Paper 2020/765

Handling Adaptive Compromise for Practical Encryption Schemes

Joseph Jaeger and Nirvan Tyagi


We provide a new definitional framework capturing the multi-user security of encryption schemes and pseudorandom functions in the face of adversaries that can adaptively compromise users' keys. We provide a sequence of results establishing the security of practical symmetric encryption schemes under adaptive compromise in the random oracle or ideal cipher model. The bulk of analysis complexity for adaptive compromise security is relegated to the analysis of lower-level primitives such as pseudorandom functions. We apply our framework to give proofs of security for the BurnBox system for privacy in the face of border searches and the in-use searchable symmetric encryption scheme due to Cash et al. In both cases, prior analyses had bugs that our framework helps avoid.

Available format(s)
Secret-key cryptography
Publication info
A major revision of an IACR publication in CRYPTO 2020
adaptive securityideal modelssearchable symmetric encryption
Contact author(s)
jsjaeger @ cs washington edu
2020-06-24: received
Short URL
Creative Commons Attribution


      author = {Joseph Jaeger and Nirvan Tyagi},
      title = {Handling Adaptive Compromise for Practical Encryption Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2020/765},
      year = {2020},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.