Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
From MaRDI portal
Publication:5026392
DOI10.1137/17M1151602MaRDI QIDQ5026392
Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam, Ran Canetti
Publication date: 8 February 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security and composition of multiparty cryptographic protocols
- On Adaptively Secure Multiparty Computation with a Short CRS
- Adaptively Secure Garbled Circuits from One-Way Functions
- Secure Computation against Adaptive Auxiliary Information
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
- Leakage-Tolerant Computation with Input-Independent Preprocessing
- Leakage-Tolerant Interactive Protocols
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- On Adaptively Secure Protocols
- Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Universally composable two-party and multi-party secure computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Foundations of Cryptography
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
This page was built for publication: Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
