Garbled RAM From One-Way Functions

DOI10.1145/2746539.2746593zbMath1321.94061OpenAlexW2071026487MaRDI QIDQ2941537

Sanjam Garg, Alessandra Scafuro, Steve Lu, Rafail Ostrovsky

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2746539.2746593

zbMATH Keywords

cryptographysecure computationgarbled RAM

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ An improved affine equivalence algorithm for random permutations ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ Adaptively secure computation for RAM programs ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Collusion-resistant functional encryption for RAMs ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Oblivious Parallel RAM and Applications ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming