Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
DOI10.1145/3055399.3055495zbMATH Open1369.68206OpenAlexW2626580035MaRDI QIDQ4977997FDOQ4977997
Authors: Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam 
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055399.3055495
Recommendations
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Adaptively secure multi-party computation from LWE (via equivocal FHE)
- Actively secure garbled circuits with constant communication overhead in the plain model
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (14)
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- Adaptively secure computation for RAM programs
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Two-round adaptively secure multiparty computation from standard assumptions
- Techniques for Efficient Secure Computation Based on Yao’s Protocol
- Better two-round adaptive multi-party computation
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Adaptively secure MPC with sublinear communication complexity
- On the power of secure two-party computation
- Adaptive security of multi-party protocols, revisited
- MPC with friends and foes
This page was built for publication: Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4977997)
