Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

DOI10.1007/978-3-642-32928-9_12MaRDI QIDQ2912796zbMATH OpenOpenAlexFDO

Authors Vladimir Kolesnikov, Ranjit Kumaresan

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32928-9_12

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Garbled circuits checking garbled circuits: more efficient and secure two-party computation
• Towards secure two-party computation from the wire-tap channel
• Optimizing authenticated garbling for faster secure two-party computation
• On the Power of Secure Two-Party Computation
• On the power of secure two-party computation
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Information Security and Cryptology
• Secure two-party computation over unreliable channels

Cited in

(10)

• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
• Secure two-party computation over unreliable channels
• On the communication complexity of secure function evaluation with long output
• Garbled circuits with sublinear evaluator
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Optimizing authenticated garbling for faster secure two-party computation
• Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

This page was built for publication: Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

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