Hashing garbled circuits for free
From MaRDI portal
Recommendations
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- On the security of the ``Free-XOR technique
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Cross and clean: amortized garbled circuits with constant overhead
Cites work
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A proof of security of Yao's protocol for two-party computation
- Advances in Cryptology - CRYPTO 2003
- Amortizing Garbled Circuits
- Calling out cheaters: covert security with public verifiability
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Efficient hashing using the AES instruction set
- Efficient secure two-party computation using symmetric cut-and-choose
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Encyclopedia of cryptography and security.
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Minimum disclosure proofs of knowledge
- Overlaying conditional circuit clauses for secure computation
- Public verifiability in the covert model (almost) for free
- Richer Efficiency/Security Trade-offs in 2PC
- 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)
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Universal circuits (Preliminary Report)
- Valiant's universal circuit is practical
Cited in
(5)- Amortizing Garbled Circuits
- On the security of the ``Free-XOR technique
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
- Garbled circuit lookup tables with logarithmic number of ciphertexts
This page was built for publication: Hashing garbled circuits for free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270371)
