Weighted oblivious RAM, with applications to searchable symmetric encryption

DOI10.1007/978-3-031-30545-0_15MaRDI QIDQ6138097zbMATH OpenOpenAlexFDO

Authors Léonard Assouline, Brice Minaud

Publication date 16 January 2024

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30545-0_15

zbMATH Keywords

searchable symmetric encryption schemesweighted ORAM

Mathematics Subject Classification ID

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

Recommendations

• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Locality-preserving oblivious RAM
• Locality-preserving oblivious RAM
• Oblivious RAM Revisited
• Optimizing ORAM and Using It Efficiently for Secure Computation

Cites work

• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Computationally volume-hiding structured encryption
• Dynamic local searchable symmetric encryption
• scientific article; zbMATH DE number 5485459 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• On the depth of oblivious parallel RAM
• On weighted balls-into-bins games
• OptORAMa: optimal oblivious RAM
• Random-index oblivious RAM
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• Software protection and simulation on oblivious RAMs
• SSE and SSD: page-efficient searchable symmetric encryption
• Structured encryption and leakage suppression
• Yes, there is an oblivious RAM lower bound!

Cited in

(1)

• Resizable oblivious RAM

This page was built for publication: Weighted oblivious RAM, with applications to searchable symmetric encryption

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