The following pages link to (Q4526994):
Displaying 34 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- An Efficient PIR Construction Using Trusted Hardware (Q3540144) (← links)
- Upper bound on the communication complexity of private information retrieval (Q4571971) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- On the Storage Cost of Private Information Retrieval (Q5138914) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Multi-client Oblivious RAM Secure Against Malicious Servers (Q6487224) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
- Doubly efficient cryptography: commitments, arguments and RAM MPC (Q6653029) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
