Simplifying game-based definitions -- indistinguishability up to correctness and its application to stateful AE

DOI10.1007/978-3-319-96881-0_1MaRDI QIDQ1784080zbMATH OpenOpenAlexFDO

Authors Phillip Rogaway, Yu-Si Zhang

Publication date 26 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96881-0_1

zbMATH Keywords

indistinguishabilityoracle silencingprovable securitystateful authenticated encryption

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Rogue Decryption Failures: Reconciling AE Robustness Notions
• Indifferentiable authenticated encryption
• Theory of Cryptography
• State separation for code-based game-playing proofs
• Constructive cryptography -- a primer. (Abstract)

Cited in

(13)

• State separation for code-based game-playing proofs
• Quantifying the security cost of migrating protocols to practice
• Jammin' on the deck
• Strongly anonymous ratcheted key exchange
• On optimal tightness for key exchange with full forward secrecy via key confirmation
• Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3
• Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels
• On the security aspects of protocol CRISP
• Integrating causality in messaging channels
• Four attacks and a proof for Telegram
• Adversarially robust learning could leverage computational hardness.
• Secure onion encryption and the case of counter Galois onion
• AEAD-mode \(\mathsf{MXP}\)-``birthday boundary transition without loss of efficiency

This page was built for publication: Simplifying game-based definitions -- indistinguishability up to correctness and its application to stateful AE

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