A new approach to garbled circuits
From MaRDI portal
Publication:6535139
DOI10.1007/978-3-031-33491-7_23zbMATH Open1542.94098MaRDI QIDQ6535139
Carmit Hazay, Efrat Cohen, Tomer Ashur, Avishay Yanai, Anasuya Acharya
Publication date: 10 November 2023
Cryptography (94A60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Cites Work
- Title not available (Why is that?)
- A proof of security of Yao's protocol for two-party computation
- Efficient adaptively secure zero-knowledge from garbled circuits
- Stacked garbling. Garbled circuit proportional to longest execution path
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
- Improved Garbled Circuit: Free XOR Gates and Applications
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Secure Two-Party Computation Is Practical
- Garbled Circuits as Randomized Encodings of Functions: a Primer
- Reusable garbled circuits and succinct functional encryption
Related Items (3)
Garbling of signals and outcome equivalence ⋮ A New Method for Constructing Circuit Codes ⋮ Amortizing Garbled Circuits
This page was built for publication: A new approach to garbled circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535139)
