\textsc{EpiGRAM}: practical garbled RAM

DOI10.1007/978-3-031-06944-4_1zbMATH Open1497.68179OpenAlexW4285224434MaRDI QIDQ2169989FDOQ2169989

Authors: Vladimir Kolesnikov, Rafail Ostrovsky, David G. Heath 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_1

Recommendations

• How to garble RAM programs?
• Gradual GRAM and secure computation for RAM programs
• Garbled RAM from one-way functions
• Garbled RAM revisited
• Cut-and-choose for garbled RAM

zbMATH Keywords

MPCoblivious RAMgarbled circuitsgarbled RAM

Mathematics Subject Classification ID

Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Improved Garbled Circuit: Free XOR Gates and Applications
• On the security of the ``Free-XOR technique
• A Permutation Network
• Adaptive garbled RAM from laconic oblivious transfer
• Fully succinct garbled RAM
• Garbled RAM from one-way functions
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Adaptive succinct garbled RAM or: how to delegate your database
• How to garble RAM programs?
• Garbled RAM revisited
• Black-box parallel garbled RAM
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits

Cited In (6)

• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• How to garble RAM programs?
• Garbled RAM revisited
• Tri-state circuits. A circuit model that captures RAM
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Privacy-preserving Dijkstra

This page was built for publication: \textsc{EpiGRAM}: practical garbled RAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169989)