Weighted oblivious RAM, with applications to searchable symmetric encryption

DOI10.1007/978-3-031-30545-0_15zbMATH Open1530.94020OpenAlexW4365936166MaRDI QIDQ6138097FDOQ6138097

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

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

zbMATH Keywords

searchable symmetric encryption schemesweighted ORAM

Mathematics Subject Classification ID

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

Cites Work

• Inequalities: theory of majorization and its applications
• On weighted balls-into-bins games
• Title not available (Why is that?)
• Software protection and simulation on oblivious RAMs
• On the depth of oblivious parallel RAM
• \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
• Structured encryption and leakage suppression
• OptORAMa: optimal oblivious RAM
• Yes, there is an oblivious RAM lower bound!
• Computationally volume-hiding structured encryption
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• SSE and SSD: page-efficient searchable symmetric encryption
• Dynamic local searchable symmetric encryption
• Random-index 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)