Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation

DOI10.1007/978-3-642-40084-1_3zbMath1300.68028OpenAlexW1247648998MaRDI QIDQ2849385

Ben Riva, Payman Mohassel

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

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

Related Items (7)

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Network Oblivious Transfer ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Oblivious transfer based on single-qubit rotations

This page was built for publication: Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation