Adaptive security for constrained PRFs

DOI10.1007/978-3-032-01901-1_19MaRDI QIDQ6862733zbMATH OpenFDO

Authors Kaishuo Cheng, Joseph Jaeger

Publication date 6 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01901-1_19

zbMATH Keywords

adaptive securityconstrained PRFsideal models

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A Provable-Security Treatment of the Key-Wrap Problem
• Adaptive Security of Constrained PRFs
• Constrained pseudorandom functions and their applications
• Functional signatures and pseudorandom functions
• Handling adaptive compromise for practical encryption schemes
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• Let attackers program ideal models: modularity and composability for adaptive compromise
• One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
• Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
• Puncturable key wrapping and its applications
• Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
• The cost of adaptivity in security games on graphs
• The power of undirected rewindings for adaptive security
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The wonderful world of global random oracles
• Verifiable and forward secure dynamic searchable symmetric encryption with storage efficiency

This page was built for publication: Adaptive security for constrained PRFs

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