Weighted oblivious RAM, with applications to searchable symmetric encryption

DOI10.1007/978-3-031-30545-0_15zbMath1530.94020OpenAlexW4365936166MaRDI QIDQ6138097

Brice Minaud, Léonard Assouline

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

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

Cites Work

• Unnamed Item
• Structured encryption and leakage suppression
• Yes, there is an oblivious RAM lower bound!
• OptORAMa: optimal oblivious RAM
• SSE and SSD: page-efficient searchable symmetric encryption
• Computationally volume-hiding structured encryption
• On weighted balls-into-bins games
• On the depth of oblivious parallel RAM
• TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
• Software protection and simulation on oblivious RAMs
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• Inequalities: theory of majorization and its applications
• Dynamic local searchable symmetric encryption
• Random-index oblivious RAM

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