Publication:4526994

zbMath0968.68040MaRDI QIDQ4526994

Victor Shoup, Rafail Ostrovsky

Publication date: 28 February 2001

zbMATH Keywords

information retrieval; information storage

Mathematics Subject Classification ID

68P15: Database theory

68P20: Information storage and retrieval of data

Related Items

Upper bound on the communication complexity of private information retrieval, CNF-FSS and Its Applications, Asymptotically Tight Bounds for Composing ORAM with PIR, Is there an oblivious RAM lower bound for online reads?, Is there an oblivious RAM lower bound for online reads?, Programmable distributed point functions, 3-party distributed ORAM from oblivious set membership, Communication-efficient distributed oblivious transfer, Dynamic proofs of retrievability via oblivious RAM, SQL on structurally-encrypted databases, An improved affine equivalence algorithm for random permutations, Simple and efficient two-server ORAM, Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution, Structured encryption and dynamic leakage suppression, Non-interactive anonymous router, Two-server distributed ORAM with sublinear computation and constant rounds, OptORAMa: optimal oblivious RAM, A logarithmic lower bound for oblivious RAM (for all Parameters), Oblivious RAM with \textit{worst-case} logarithmic overhead, Oblivious network RAM and leveraging parallelism to achieve obliviousness, Oblivious RAM with worst-case logarithmic overhead, Private Database Access with HE-over-ORAM Architecture, Oblivious Parallel RAM and Applications, Secure Multiparty RAM Computation in Constant Rounds, An Efficient PIR Construction Using Trusted Hardware