Handling adaptive compromise for practical encryption schemes

DOI10.1007/978-3-030-56784-2_1zbMath1501.94045OpenAlexW3037219456MaRDI QIDQ2096475

Joseph Jaeger, Nirvan Tyagi

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_1

zbMATH Keywords

adaptive securitysymmetric cryptographysearchable symmetric encryptionideal models

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

A fast and simple partially oblivious PRF, with applications ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ Puncturable key wrapping and its applications ⋮ Authenticated encryption with key identification ⋮ Improved structured encryption for SQL databases via hybrid indexing

Cites Work

• Probabilistic encryption
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Indifferentiable authenticated encryption
• Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security
• To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
• Random Oracles with(out) Programmability
• Keying Hash Functions for Message Authentication
• A Provable-Security Treatment of the Key-Wrap Problem
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• The Locality of Searchable Symmetric Encryption
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Theory of Cryptography
• Tight tradeoffs in searchable symmetric encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Handling adaptive compromise for practical encryption schemes