Maliciously secure multi-client ORAM
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- A Verifiable Secret Shuffe of Homomorphic Encryptions
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- Oblivious RAMs without cryptogarphic assumptions
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Path ORAM
- Perfectly secure oblivious RAM without random oracles
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Private information retrieval
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Software protection and simulation on oblivious RAMs
- Verifiable oblivious storage
Cited in
(6)- Multi-client oblivious RAM with poly-logarithmic communication
- Multi-client Oblivious RAM Secure Against Malicious Servers
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Encrypted multi-map that hides query, access, and volume patterns
- M-ORAM Revisited: Security and Construction Updates
- Multi-user binary tree based ORAM scheme
This page was built for publication: Maliciously secure multi-client ORAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487223)