International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens

Authors:
Saikrishna Badrinarayanan
Abhishek Jain
Rafail Ostrovsky
Ivan Visconti
Download:
DOI: 10.1007/978-3-030-34621-8_21
Search ePrint
Search Google
Abstract: We revisit the problem of universally composable (UC) secure multiparty computation in the stateless hardware token model. We construct a three round multi-party computation protocol for general functions based on one-way functions where each party sends two tokens to every other party. Relaxing to the two-party case, we also construct a two round protocol based on one-way functions where each party sends a single token to the other party, and at the end of the protocol, both parties learn the output.One of the key components in the above constructions is a new two-round oblivious transfer protocol based on one-way functions using only one token, which can be reused an unbounded polynomial number of times. All prior constructions required either stronger complexity assumptions, or larger number of rounds, or a larger number of tokens.
BibTeX
@article{asiacrypt-2019-30052,
  title={UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens},
  booktitle={Advances in Cryptology – ASIACRYPT 2019},
  series={Advances in Cryptology – ASIACRYPT 2019},
  publisher={Springer},
  volume={11922},
  pages={577-605},
  doi={10.1007/978-3-030-34621-8_21},
  author={Saikrishna Badrinarayanan and Abhishek Jain and Rafail Ostrovsky and Ivan Visconti},
  year=2019
}