Garbled circuit lookup tables with logarithmic number of ciphertexts
From MaRDI portal
Publication:6637543
DOI10.1007/978-3-031-58740-5_7MaRDI QIDQ6637543
Lucien K. L. Ng, Vladimir Kolesnikov, David G. Heath
Publication date: 13 November 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- A proof of security of Yao's protocol for two-party computation
- The complexity of multiparty PSM protocols and related models
- Overlaying conditional circuit clauses for secure computation
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Stacked garbling. Garbled circuit proportional to longest execution path
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- \textsc{EpiGRAM}: practical garbled RAM
- Garbled circuits with sublinear evaluator
- Covert security with public verifiability: faster, leaner, and simpler
- Efficient pseudorandom correlation generators: silent OT extension and more
- A minimal model for secure computation (extended abstract)
- Improved OT Extension for Transferring Short Secrets
- 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
- On the Security of the “Free-XOR” Technique
- Two Halves Make a Whole
- Improved Garbled Circuit: Free XOR Gates and Applications
- Secure Two-Party Computation Is Practical
- On the Power of Correlated Randomness in Secure Computation
- How to Garble RAM Programs?
- Communication preserving protocols for secure function evaluation
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient arithmetic in garbled circuits
This page was built for publication: Garbled circuit lookup tables with logarithmic number of ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637543)
