Fast garbling of circuits under standard assumptions

DOI10.1007/s00145-017-9271-yzbMath1400.94146OpenAlexW2773835262MaRDI QIDQ2413616

Benny Pinkas, Ariel Nof, Yehuda Lindell, Shay Gueron

Publication date: 14 September 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-017-9271-y

zbMATH Keywords

garblingmulti-party computationsecure protocols

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Related Items (20)

Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Adaptive security of practical garbling schemes ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ High-throughput secure three-party computation with an honest majority ⋮ Better security-efficiency trade-offs in permutation-based two-party computation ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ On multiparty garbling of arithmetic circuits ⋮ Secure two-party computation in a quantum world ⋮ Scalable Multi-party Private Set-Intersection ⋮ Public-Seed Pseudorandom Permutations ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ The price of active security in cryptographic protocols ⋮ TNT: how to tweak a block cipher

Uses Software

• JustGarble
• FleXOR

Cites Work

• A proof of security of Yao's protocol for two-party computation
• FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
• On the Security of the “Free-XOR” Technique
• Two Halves Make a Whole
• Distinguisher and Related-Key Attack on the Full AES-256
• Intel’s New AES Instructions for Enhanced Performance and Security
• Improved Garbled Circuit: Free XOR Gates and Applications
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• Secure Two-Party Computation Is Practical
• Known-Key Distinguishers for Some Block Ciphers
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Fast garbling of circuits under standard assumptions