scientific article; zbMATH DE number 7053266
From MaRDI portal
Publication:5743385
zbMath1422.68061MaRDI QIDQ5743385
Steve Lu, Eyal Kushilevitz, Rafail Ostrovsky
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095129
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20)
Related Items (28)
Perfectly secure oblivious parallel RAM ⋮ SQL on structurally-encrypted databases ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Unnamed Item ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Stronger lower bounds for online ORAM ⋮ The complexity of secure RAMs ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Random-index oblivious RAM ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Limits of breach-resistant and snapshot-oblivious RAMs ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Locality-preserving oblivious RAM ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Structured encryption and dynamic leakage suppression ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Unnamed Item ⋮ OptORAMa: optimal oblivious RAM
Cites Work
- Oblivious RAMs without cryptogrpahic assumptions
- Perfectly Secure Oblivious RAM without Random Oracles
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Oblivious RAM Revisited
- Public-Key Encryption with Efficient Amortized Updates
- Public Key Encryption That Allows PIR Queries
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- Space/time trade-offs in hash coding with allowable errors
- More Robust Hashing: Cuckoo Hashing with a Stash
- Unnamed Item
This page was built for publication:
