Welcome to the resource topic for 2022/200
Title:
Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds
Authors: 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.
ePrint: https://eprint.iacr.org/2022/200
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .