On Symmetric Encryption with Distinguishable Decryption Failures

DOI10.1007/978-3-662-43933-3_19zbMath1321.94044OpenAlexW2122144036MaRDI QIDQ2946887

Kenneth G. Paterson, Jean Paul Degabriele, Martijn Stam, Alexandra Boldyreva

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43933-3_19

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Hidden shift quantum cryptanalysis and implications ⋮ Rogue Decryption Failures: Reconciling AE Robustness Notions ⋮ Partition oracles from weak key forgeries ⋮ A message franking channel ⋮ On Symmetric Encryption with Distinguishable Decryption Failures ⋮ Overloading the nonce: rugged PRPs, nonce-set AEAD, and order-resilient channels ⋮ Simulatable channels: extended security that is universally composable and easier to prove ⋮ RIV for Robust Authenticated Encryption ⋮ Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC

Cites Work

• Authenticated-Encryption with Padding: A Formal Security Treatment
• On Symmetric Encryption with Distinguishable Decryption Failures
• Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol
• Modular Multiplication Without Trial Division
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• Breaking and provably repairing the SSH authenticated encryption scheme
• Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
• On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption
• Speeding Up Bipartite Modular Multiplication
• A Provable-Security Treatment of the Key-Wrap Problem
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• Monte Carlo Methods for Index Computation (mod p)
• A Pseudorandom Generator from any One-way Function
• Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
• Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
• Advances in Cryptology - CRYPTO 2003
• Fast Software Encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Symmetric Encryption with Distinguishable Decryption Failures