Partition oracles from weak key forgeries

DOI10.1007/978-3-030-92548-2_3zbMath1503.94023OpenAlexW4206646609MaRDI QIDQ2149813

Carlos Cid, Marcel Armour

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_3

zbMATH Keywords

authenticated encryptionGCMpartitioning oraclespolynomial hashingweak key forgeries

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks

Uses Software

• ChaCha
• GitHub
• Poly1305-AES

Cites Work

• Unnamed Item
• Unnamed Item
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Fast message franking: from invisible salamanders to encryptment
• Message franking via committing authenticated encryption
• Subverting decryption in AEAD
• Lucky Microseconds: A Timing Attack on Amazon’s s2n Implementation of TLS
• On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes
• On Symmetric Encryption with Distinguishable Decryption Failures
• Twisted Polynomials and Forgery Attacks on GCM
• Keying Hash Functions for Message Authentication
• Cryptographic Extraction and Key Derivation: The HKDF Scheme
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes
• Fast Software Encryption
• A new algorithm for optimization
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: Partition oracles from weak key forgeries