Garbled circuits checking garbled circuits: more efficient and secure two-party computation

DOI10.1007/978-3-642-40084-1_3MaRDI QIDQ2849385zbMATHOpenAlexFDO

Authors Payman Mohassel, Ben Riva

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_3

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Two-output secure computation with malicious adversaries
• Efficient secure two-party computation using symmetric cut-and-choose
• On the leakage of corrupted garbled circuits

Cited in

(12)

• Network oblivious transfer
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• Enforcing input correctness via certification in garbled circuit evaluation
• Going beyond dual execution: MPC for functions with efficient verification
• Oblivious transfer based on single-qubit rotations
• On the leakage of corrupted garbled circuits
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Non-interactive secure 2PC in the offline/online and batch settings
• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

This page was built for publication: Garbled circuits checking garbled circuits: more efficient and secure two-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849385)