Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution

DOI10.1007/978-3-030-77883-5_12OpenAlexW3080504001MaRDI QIDQ2056797FDOQ2056797

Authors: Yanyan Li 

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_12

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• Cuckoo hashing
• Title not available (Why is that?)
• Oblivious RAM Revisited
• Software protection and simulation on oblivious RAMs
• Privacy-preserving access of outsourced data via oblivious RAM simulation
• More robust hashing: cuckoo hashing with a stash
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Privacy-preserving group data access via stateless oblivious RAM simulation
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• On the (in)security of hash-based oblivious RAM and a new balancing scheme
• Sub-logarithmic distributed oblivious RAM with small block size
• Distributed Oblivious RAM for Secure Two-Party Computation
• OptORAMa: optimal oblivious RAM
• Some Open Questions Related to Cuckoo Hashing
• Data-oblivious data structures

Cited In (8)

• 3-party distributed ORAM from oblivious set membership
• Generalized cuckoo hashing with a stash, revisited
• OptORAMa: Optimal oblivious RAM
• Cuckoo hashing in cryptography: optimal parameters, robustness and applications
• 3-party secure computation for RAMs: optimal and concretely efficient
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• SSE and SSD: page-efficient searchable symmetric encryption
• Oblivious RAM with worst-case logarithmic overhead

This page was built for publication: Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056797)