Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique

DOI10.1007/978-3-642-42045-0_23zbMath1326.94078OpenAlexW2143135193MaRDI QIDQ2867169

Luís T. A. N. Brandão

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_23

zbMATH Keywords

cut-and-choosesecure two-party computationgarbled circuitsforge-and-losehomomorphic bit-commitments with trapdoor

Mathematics Subject Classification ID

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

Related Items (5)

Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Hashing Garbled Circuits for Free

Uses Software

• MiniLEGO

This page was built for publication: Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique