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

DOI10.1007/978-3-642-40084-1_3zbMATH Open1300.68028OpenAlexW1247648998MaRDI QIDQ2849385FDOQ2849385

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

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

Mathematics Subject Classification ID

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

Cited In (10)

• Non-interactive Secure 2PC in the Offline/Online and Batch Settings
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• 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
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Network Oblivious Transfer
• Going beyond dual execution: MPC for functions with efficient verification
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Oblivious transfer based on single-qubit rotations
• 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)