How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
From MaRDI portal
Publication:2953802
DOI10.1007/978-3-662-53890-6_32zbMath1407.94127OpenAlexW2554094111MaRDI QIDQ2953802
Carmen Kempka, Koutarou Suzuki, Ryo Kikuchi
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_32
Related Items (1)
Uses Software
Cites Work
- Fast garbling of circuits under standard assumptions
- Garbling Scheme for Formulas with Constant Size of Garbled Gates
- 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
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- Amortizing Garbled Circuits
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Two Halves Make a Whole
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Two-Output Secure Computation with Malicious Adversaries
- Constant-Round Private Function Evaluation with Linear Complexity
- Improved Garbled Circuit: Free XOR Gates and Applications
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- LEGO for Two-Party Secure Computation
- Secure Two-Party Computation Is Practical
- Universal circuits (Preliminary Report)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
This page was built for publication: How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
