How to circumvent the two-ciphertext lower bound for linear garbling schemes

DOI10.1007/978-3-662-53890-6_32zbMATH Open1407.94127OpenAlexW2554094111MaRDI QIDQ2953802FDOQ2953802

Authors: Carmen Kempka, Ryo Kikuchi, Koutarou Suzuki 

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

Recommendations

• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• On garbling schemes with and without privacy
• Improved Garbled Circuit: Free XOR Gates and Applications
• Improvements for gate-hiding garbled circuits

zbMATH Keywords

garbled circuitslower bound on linear garbling schemessemi-private function evaluation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
• Improved Garbled Circuit: Free XOR Gates and Applications
• 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 via cut-and-choose oblivious transfer
• Two-output secure computation with malicious adversaries
• LEGO for Two-Party Secure Computation
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Secure two-party computation is practical
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Universal circuits (Preliminary Report)
• Amortizing Garbled Circuits
• Two Halves Make a Whole
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Fast garbling of circuits under standard assumptions
• MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
• Constant-round private function evaluation with linear complexity
• Garbling Scheme for Formulas with Constant Size of Garbled Gates
• Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique

Cited In (2)

• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• A new approach to garbled circuits

Uses Software

• MiniLEGO
• JustGarble
• FleXOR

This page was built for publication: How to circumvent the two-ciphertext lower bound for linear garbling schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953802)