Let attackers program ideal models: modularity and composability for adaptive compromise

DOI10.1007/978-3-031-30620-4_4zbMath1528.94059OpenAlexW4365807539MaRDI QIDQ6085264

Joseph Jaeger

Publication date: 12 December 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_4

zbMATH Keywords

adaptive securityideal modelsselective-opening attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The wonderful world of global random oracles
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• A modular analysis of the Fujisaki-Okamoto transformation
• Secure integration of asymmetric and symmetric encryption schemes
• Handling adaptive compromise for practical encryption schemes
• Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
• Selective Opening Security for Receivers
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• Virtual Smart Cards: How to Sign with a Password and a Server
• Standard Security Does Not Imply Security against Selective-Opening
• On Definitions of Selective Opening Security
• Selective Opening Security from Simulatable Data Encapsulation
• Standard Security Does Not Imply Indistinguishability Under Selective Opening
• Keying Hash Functions for Message Authentication
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Zero Knowledge in the Random Oracle Model, Revisited
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance

This page was built for publication: Let attackers program ideal models: modularity and composability for adaptive compromise