scientific article; zbMATH DE number 1559545
From MaRDI portal
Publication:4526994
Recommendations
Cited in
(45)- 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
- Private information retrieval
- Secure multiparty RAM computation in constant rounds
- Efficient Negative Databases from Cryptographic Hash Functions
- An Efficient PIR Construction Using Trusted Hardware
- Communication-efficient distributed oblivious transfer
- Upper bound on the communication complexity of private information retrieval
- CNF-FSS and its applications
- On the Storage Cost of Private Information Retrieval
- 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?
- 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
- Multi-client Oblivious RAM Secure Against Malicious Servers
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- OptORAMa: Optimal oblivious RAM
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- 3-party secure computation for RAMs: optimal and concretely efficient
- Non-interactive anonymous router with quasi-linear router computation
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- Compressing unit-vector correlations via sparse pseudorandom generators
- Privacy-preserving Dijkstra
- Zero-knowledge RAM: doubly efficient and black-box
- A logarithmic lower bound for oblivious RAM (for all parameters)
- Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
- Differentially oblivious Turing machines
- MetaDORAM: info-theoretic distributed ORAM with less communication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526994)
