Paper 2025/2122

Adaptive Security for Constrained PRFs

Kaishuo Cheng, Georgia Institute of Technology
Joseph Jaeger, Georgia Institute of Technology
Abstract

There is a gap between the security of constrained PRFs required in some applications and the security provided by existing definitions. This gap is typically patched by only considering nonadaptive security or manually mixing the CPRF with a random oracle (implicitly constructing a new CPRF) to achieve adaptive security. We fill this gap with a new definition for constrained PRFs with strong adaptive security properties and proofs that it is achieved by practical constructions based on the cascade PRF (which generalizes the GGM construction) and AMAC. We apply the definition for analyzing searchable symmetric encryption and puncturable key wrapping.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
A major revision of an IACR publication in CRYPTO 2025
DOI
10.1007/978-3-032-01901-1_19
Keywords
Adaptive SecurityIdeal ModelsProvable SecuritySelective Opening AttacksSearchable Symmetric encryption
Contact author(s)
kcheng89 @ gatech edu
josephjaeger @ gatech edu
History
2025-11-21: approved
2025-11-20: received
See all versions
Short URL
https://ia.cr/2025/2122
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/2122,
      author = {Kaishuo Cheng and Joseph Jaeger},
      title = {Adaptive Security for Constrained {PRFs}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/2122},
      year = {2025},
      doi = {10.1007/978-3-032-01901-1_19},
      url = {https://eprint.iacr.org/2025/2122}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.