The following pages link to Garbled RAM Revisited (Q5418708):
Displaying 27 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Secret-shared shuffle (Q2691590) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- Cryptography with Updates (Q5738983) (← links)
