Multi-client oblivious RAM with poly-logarithmic communication
From MaRDI portal
Recommendations
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Maliciously secure multi-client ORAM
- Oblivious parallel RAM: improved efficiency and generic constructions
- Sub-logarithmic distributed oblivious RAM with small block size
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
Cites work
- A primer on pseudorandom generators
- Breaking the circuit size barrier for secure computation under DDH
- Can we access a database both locally and privately?
- Compressible FHE with applications to PIR
- Constrained pseudorandom functions and their applications
- Distributed Point Functions and Their Applications
- Efficient 3-party distributed ORAM
- Foundations of homomorphic secret sharing
- Function secret sharing
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic secret sharing from Paillier encryption
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Maliciously secure multi-client ORAM
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Private anonymous data access
- Private information retrieval
- Real traceable signatures
- Towards doubly efficient private information retrieval
Cited in
(7)
This page was built for publication: Multi-client oblivious RAM with poly-logarithmic communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692380)
