Cross and Clean: Amortized Garbled Circuits with Constant Overhead

DOI10.1007/978-3-662-53641-4_22zbMath1406.94076OpenAlexW2537577390MaRDI QIDQ3179371

Claudio Orlandi, Jesper Buus Nielsen

Publication date: 21 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_22

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Actively secure garbled circuits with constant communication overhead in the plain model

Uses Software

• MiniLEGO
• TinyLEGO

Cites Work

• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
• Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
• Amortizing Garbled Circuits
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
• Two Halves Make a Whole
• Universally composable two-party and multi-party secure computation
• LEGO for Two-Party Secure Computation
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two-Party Secure Computation on Committed Inputs
• Public Key Cryptography - PKC 2006

This page was built for publication: Cross and Clean: Amortized Garbled Circuits with Constant Overhead