Paper 2022/200

Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds

Akshayaram Srinivasan

Abstract

The round complexity of secure two-party computation is a long studied problem with matching upper and lower bounds for the case of black-box simulators (i.e., the simulators that use the adversary as a black-box). In this work, we focus on going beyond this black-box barrier via non-black-box techniques. Specifically, based on standard cryptographic assumptions, we give a construction of a 3-round two-party computation protocol for computing inputless functionalities (such as coin-tossing) that satisfies standard security against malicious senders and $\epsilon$-security against malicious receivers. Prior to our work such protocols were only known for the case of (weak) zero-knowledge.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. Minor revision.
Keywords
Non-Black-Box SimulationTwo-Party ComputationInputless Functionalities
Contact author(s)
akshayaram srinivasan @ tifr res in
History
2022-02-20: received
Short URL
https://ia.cr/2022/200
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/200,
      author = {Akshayaram Srinivasan},
      title = {Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds},
      howpublished = {Cryptology ePrint Archive, Paper 2022/200},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/200}},
      url = {https://eprint.iacr.org/2022/200}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.