scientific article; zbMATH DE number 1559545
From MaRDI portal
Publication:4526994
zbMath0968.68040MaRDI QIDQ4526994
Victor Shoup, Rafail Ostrovsky
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
SQL on structurally-encrypted databases ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ An improved affine equivalence algorithm for random permutations ⋮ Upper bound on the communication complexity of private information retrieval ⋮ CNF-FSS and Its Applications ⋮ A theory of composition for differential obliviousness ⋮ Programmable distributed point functions ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Arithmetic sketching ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Communication-efficient distributed oblivious transfer ⋮ Simple and efficient two-server ORAM ⋮ An Efficient PIR Construction Using Trusted Hardware ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ 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? ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Oblivious Parallel RAM and Applications ⋮ 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 ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ OptORAMa: optimal oblivious RAM
This page was built for publication:
