Pages that link to "Item:Q2941537"
From MaRDI portal
The following pages link to Garbled RAM From One-Way Functions (Q2941537):
Displaying 18 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← 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)
- \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 Parallel RAM and Applications (Q2799095) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← 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)
- 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)
- R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)