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

DOI10.1007/978-3-319-96881-0_1zbMath1430.94086OpenAlexW2884610574MaRDI QIDQ1784080

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

indistinguishabilityprovable securityoracle silencingstateful authenticated encryption

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Quantifying the security cost of migrating protocols to practice

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