Tri-state circuits. A circuit model that captures RAM
From MaRDI portal
Publication:6190100
DOI10.1007/978-3-031-38551-3_5OpenAlexW4385654249MaRDI QIDQ6190100
David G. Heath, Rafail Ostrovsky, Vladimir Kolesnikov
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_5
Cites Work
- Unnamed Item
- Optimizing authenticated garbling for faster secure two-party computation
- Cut-and-choose for garbled RAM
- A proof of security of Yao's protocol for two-party computation
- Black-box parallel garbled RAM
- Fast garbling of circuits over 3-valued logic
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- \textsc{EpiGRAM}: practical garbled RAM
- Fast garbling of circuits under standard assumptions
- Fully Succinct Garbled RAM
- Adaptively Secure Garbled Circuits from One-Way Functions
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- On the Security of the “Free-XOR” Technique
- Garbled RAM From One-Way Functions
- Two Halves Make a Whole
- Secure Multiparty RAM Computation in Constant Rounds
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Improved Garbled Circuit: Free XOR Gates and Applications
- Storage Modification Machines
- Software protection and simulation on oblivious RAMs
- How to Garble RAM Programs?
- Garbled RAM Revisited
- Authenticated garbling from simple correlations
This page was built for publication: Tri-state circuits. A circuit model that captures RAM
