The power of undirected rewindings for adaptive security

DOI10.1007/978-3-031-38545-2_24OpenAlexW4385654533MaRDI QIDQ6145931

Julia Kastner, Dennis Hofheinz, Karen Klein

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_24

zbMATH Keywords

partitioning reductionssignature generation problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Be adaptive, avoid overcommitting
• Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
• Adaptively secure constrained pseudorandom functions in the standard model
• Multicast key agreement, revisited
• The cost of adaptivity in security games on graphs
• Constrained Pseudorandom Functions and Their Applications
• Security Proofs for Signature Schemes
• Waters Signatures with Optimal Security Reduction
• Adaptive Security of Constrained PRFs
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Short and Stateless Signatures from the RSA Assumption
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Programmable Hash Functions and Their Applications
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Efficient Identity-Based Encryption Without Random Oracles
• Functional Signatures and Pseudorandom Functions
• Why Proving HIBE Systems Secure Is Difficult
• On the Impossibility of Tight Cryptographic Reductions
• The Abe-Okamoto partially blind signature scheme revisited