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

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

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

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

Related Items (5)

SSE and SSD: page-efficient searchable symmetric encryption ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Oblivious RAM with worst-case logarithmic overhead

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• OptORAMa: optimal oblivious RAM
• Sub-logarithmic distributed oblivious RAM with small block size
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Data-Oblivious Data Structures
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Oblivious RAM Revisited
• Some Open Questions Related to Cuckoo Hashing
• Software protection and simulation on oblivious RAMs
• Cuckoo hashing
• Distributed Oblivious RAM for Secure Two-Party Computation
• More Robust Hashing: Cuckoo Hashing with a Stash

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