Garbled RAM Revisited

From MaRDI portal
Publication:5418708

DOI10.1007/978-3-642-55220-5_23zbMath1332.94067OpenAlexW238561561MaRDI QIDQ5418708

Rafail Ostrovsky, Steve Lu, Shai Halevi, Mariana Raykova, Craig Gentry, Daniel Wichs

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_23




Related Items (33)

Succinct garbling schemes from functional encryption through a local simulation paradigmFE and iO for Turing machines from minimal assumptionsA logarithmic lower bound for oblivious RAM (for all Parameters)Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and timeSecure Multiparty RAM Computation in Constant RoundsConstant-Round Maliciously Secure Two-Party Computation in the RAM ModelEfficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized CostIndistinguishability Obfuscation from Compact Functional EncryptionDelegating RAM Computations with Adaptive Soundness and PrivacyAdaptive Succinct Garbled RAM or: How to Delegate Your DatabaseAn improved affine equivalence algorithm for random permutations\textsc{EpiGRAM}: practical garbled RAMAdaptively secure computation for RAM programsIndistinguishability Obfuscation for RAM Programs and Succinct Randomized EncodingsAdaptively secure garbling schemes for parallel computationsBounded Collusion ABE for TMs from IBEReactive Garbling: Foundation, Instantiation, ApplicationBounded functional encryption for Turing machines: adaptive security from general assumptionsCollusion-resistant functional encryption for RAMsNanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overheadTri-state circuits. A circuit model that captures RAMSecret-shared shuffleSublinear Zero-Knowledge Arguments for RAM ProgramsCryptography with UpdatesConstant-round maliciously secure two-party computation in the RAM modelDoubly efficient private information retrieval and fully homomorphic RAM computation from ring LWEOnion ORAM: A Constant Bandwidth Blowup Oblivious RAMOblivious Parallel RAM and ApplicationsTwo-server distributed ORAM with sublinear computation and constant roundsHigh-Precision Secure Computation of Satellite Collision ProbabilitiesTWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable EncryptionOblivious network RAM and leveraging parallelism to achieve obliviousnessGarbled Circuits as Randomized Encodings of Functions: a Primer







This page was built for publication: Garbled RAM Revisited