Fast garbling of circuits under standard assumptions
From MaRDI portal
Publication:2413616
DOI10.1007/S00145-017-9271-YzbMATH Open1400.94146OpenAlexW2773835262MaRDI QIDQ2413616FDOQ2413616
Authors: Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas 
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
Recommendations
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Faster secure two-party computation in the single-execution setting
- Adaptively secure garbling with near optimal online complexity
- Improved Garbled Circuit: Free XOR Gates and Applications
Cites Work
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- A proof of security of Yao's protocol for two-party computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- Advances in Cryptology - CRYPTO 2003
- Distinguisher and Related-Key Attack on the Full AES-256
- Intel’s New AES Instructions for Enhanced Performance and Security
- Known-Key Distinguishers for Some Block Ciphers
- On the Security of the “Free-XOR” Technique
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Secure two-party computation is practical
- Two Halves Make a Whole
Cited In (28)
- Block cipher invariants as eigenvectors of correlation matrices
- Public-Seed Pseudorandom Permutations
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- TNT: how to tweak a block cipher
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Efficient non-interactive secure computation
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
- Breaking and fixing garbled circuits when a gate has duplicate input wires
- Sublinear secure computation from new assumptions
- Better security-efficiency trade-offs in permutation-based two-party computation
- On multiparty garbling of arithmetic circuits
- Tri-state circuits. A circuit model that captures RAM
- Linicrypt: A Model for Practical Cryptography
- Faster real feasibility via circuit discriminants
- Amortizing Garbled Circuits
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Efficient arithmetic in garbled circuits
- How to garble mixed circuits that combine Boolean and arithmetic computations
- Stacked garbling. Garbled circuit proportional to longest execution path
- The price of active security in cryptographic protocols
- Scalable Multi-party Private Set-Intersection
- Secure two-party computation in a quantum world
- High-throughput secure three-party computation with an honest majority
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Adaptive security of practical garbling schemes
Uses Software
This page was built for publication: Fast garbling of circuits under standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413616)
