Structured encryption and distribution-aware leakage suppression

DOI10.1007/978-981-95-5096-8_7MaRDI QIDQ6834090zbMATH OpenFDO

Authors Marilyn George, Seny Kamara, Tarik Moataz, Zachary Espiritu

Publication date 31 March 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5096-8_7

zbMATH Keywords

leakage suppressionoblivious dictionariesstructured encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Boolean searchable symmetric encryption with worst-case sub-linear complexity
• CacheShuffle: a family of oblivious shuffles
• Computationally volume-hiding structured encryption
• Concurrent encrypted multimaps
• Efficient searchable symmetric encryption for join queries
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Improved structured encryption for SQL databases via hybrid indexing
• Injection-secure structured and searchable symmetric encryption
• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• Software protection and simulation on oblivious RAMs
• SQL on structurally-encrypted databases
• SSE and SSD: page-efficient searchable symmetric encryption
• Structured encryption and controlled disclosure
• Structured encryption and dynamic leakage suppression
• Structured encryption and leakage suppression
• The locality of searchable symmetric encryption
• The Melbourne shuffle: improving oblivious storage in the cloud
• Yes, there is an oblivious RAM lower bound!

This page was built for publication: Structured encryption and distribution-aware leakage suppression

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