Handling adaptive compromise for practical encryption schemes
From MaRDI portal
Publication:2096475
Recommendations
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- Indifferentiable authenticated encryption
- Keying hash functions for message authentication
- Merkle-Damgård Revisited: How to Construct a Hash Function
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Probabilistic encryption
- Random oracles with(out) programmability
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- The locality of searchable symmetric encryption
- Theory of Cryptography
- Tight tradeoffs in searchable symmetric encryption
- To hash or not to hash again? (In)differentiability results for H^2 and HMAC
Cited in
(13)- Improved structured encryption for SQL databases via hybrid indexing
- A fast and simple partially oblivious PRF, with applications
- Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
- Composition Implies Adaptive Security in Minicrypt
- scientific article; zbMATH DE number 2050890 (Why is no real title available?)
- Let attackers program ideal models: modularity and composability for adaptive compromise
- Puncturable key wrapping and its applications
- Authenticated encryption with key identification
- Agile cryptography: a universally composable approach
- Latke: a framework for constructing identity-binding PAKEs
- Adaptive security for constrained PRFs
- Dictators? Friends? Forgers. Breaking and fixing unforgeability definitions for anamorphic signature schemes
- Secure cloud storage: modularization, network adversaries and adaptive corruptions
This page was built for publication: Handling adaptive compromise for practical encryption schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096475)