Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

\textsc{EpiGRAM}: practical garbled RAM

From MaRDI portal
Publication:2169989
Jump to:navigation, search

DOI10.1007/978-3-031-06944-4_1zbMath1497.68179OpenAlexW4285224434MaRDI QIDQ2169989

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

zbMATH Keywords

MPCoblivious RAMgarbled circuitsgarbled RAM


Mathematics Subject Classification ID

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


Related Items

NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead, Tri-state circuits. A circuit model that captures RAM



Cites Work

  • Adaptive garbled RAM from laconic oblivious transfer
  • Black-box parallel garbled RAM
  • Three halves make a whole? Beating the half-gates lower bound for garbled circuits
  • Fully Succinct Garbled RAM
  • On the Security of the “Free-XOR” Technique
  • Garbled RAM From One-Way Functions
  • Two Halves Make a Whole
  • Adaptive Succinct Garbled RAM or: How to Delegate Your Database
  • Improved Garbled Circuit: Free XOR Gates and Applications
  • How to Garble RAM Programs?
  • Garbled RAM Revisited
  • A Permutation Network
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2169989&oldid=14687745"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 01:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki