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

DOI10.1007/978-3-662-53890-6_32MaRDI QIDQ2953802zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

garbled circuitslower bound on linear garbling schemessemi-private function evaluation

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• Amortizing Garbled Circuits
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Constant-round private function evaluation with linear complexity
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Efficient secure two-party computation using symmetric cut-and-choose
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Fast garbling of circuits under standard assumptions
• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Garbling scheme for formulas with constant size of garbled gates
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Improved Garbled Circuit: Free XOR Gates and Applications
• LEGO for Two-Party Secure Computation
• MiniLEGO: efficient secure two-party computation from general assumptions
• Secure two-party computation is practical
• Secure two-party computation via cut-and-choose oblivious transfer
• Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Two-output secure computation with malicious adversaries
• Universal circuits (Preliminary Report)

Cited in

(12)

• Fast garbling of circuits over 3-valued logic
• Better concrete security for half-gates garbling (in the multi-instance setting)
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits
• Garbled circuits with sublinear evaluator
• Garbling scheme for formulas with constant size of garbled gates
• On garbling schemes with and without privacy
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• A new approach to garbled circuits
• Lower bounds for garbled circuits from Shannon-type information inequalities
• Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
• Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits
• Analysis on sliced garbling via algebraic approach

Describes a project that uses

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)