The following pages link to How to Garble RAM Programs? (Q4924441):
Displaying 32 items.
- 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)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← 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 RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← 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)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← 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)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- Cryptography with Updates (Q5738983) (← links)
- R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation (Q6636505) (← links)
- Efficient arithmetic in garbled circuits (Q6637536) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
