The Multi-user Security of Double Encryption

DOI10.1007/978-3-319-56614-6_13zbMath1415.94438OpenAlexW2603513604MaRDI QIDQ5738981

Stefano Tessaro, Viet Tung Hoang

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_13

zbMATH Keywords

provable securitymulti-user securitydouble encryptionsymmetric security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ BBB Secure Nonce Based MAC Using Public Permutations ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Tight security of cascaded LRW2 ⋮ Multi-user security of the sum of truncated random permutations ⋮ Improved multi-user security using the squared-ratio method ⋮ Luby-Rackoff backwards with more users and more security ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ Multi-user BBB security of public permutations based MAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to stretch random functions: The security of protected counter sums
• How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
• Optimally Secure Block Ciphers from Ideal Primitives
• Hash-Function Based PRFs: AMAC and Its Multi-User Security
• Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
• The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
• Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
• The Security of Multiple Encryption in the Ideal Cipher Model
• Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
• Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
• Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
• Security of Keyed Sponge Constructions Using a Modular Proof Approach
• Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
• Multi-key Security: The Even-Mansour Construction Revisited
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The “Coefficients H” Technique
• Cascade Encryption Revisited
• Format-Preserving Encryption
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
• Tight Security Bounds for Key-Alternating Ciphers
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: The Multi-user Security of Double Encryption