Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
From MaRDI portal
Publication:2849384
DOI10.1007/978-3-642-40084-1_2zbMath1316.94078OpenAlexW1837551011MaRDI QIDQ2849384
Yan Huang, David Elliot Evans, Jonathan N. Katz
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_2
Related Items (14)
Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Round optimal black-box ``commit-and-prove ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting ⋮ Asymptotically quasi-optimal cryptography ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Universal Samplers with Fast Verification ⋮ Network Oblivious Transfer ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Hashing Garbled Circuits for Free
Uses Software
This page was built for publication: Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
