Hashing Garbled Circuits for Free

DOI10.1007/978-3-319-56617-7_16zbMath1415.94428OpenAlexW2594794309MaRDI QIDQ5270371

Xiong Fan, Vladimir Kolesnikov, Chaya Ganesh

Publication date: 23 June 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_16

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• OpenSSL
• GitHub
• libgarble
• JustGarble
• FleXOR

Cites Work

• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Minimum disclosure proofs of knowledge
• Overlaying conditional circuit clauses for secure computation
• Public Verifiability in the Covert Model (Almost) for Free
• Valiant’s Universal Circuit is Practical
• Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
• 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
• Encyclopedia of Cryptography and Security
• Efficient Hashing Using the AES Instruction Set
• Improved Garbled Circuit: Free XOR Gates and Applications
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• Secure Two-Party Computation Is Practical
• Universal circuits (Preliminary Report)
• Calling Out Cheaters: Covert Security with Public Verifiability
• Richer Efficiency/Security Trade-offs in 2PC
• Advances in Cryptology - CRYPTO 2003
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

This page was built for publication: Hashing Garbled Circuits for Free