Salvaging Weak Security Bounds for Blockcipher-Based Constructions

DOI10.1007/978-3-662-53887-6_16zbMath1404.94113MaRDI QIDQ2958132

R. Seth Terashima, Thomas Shrimpton

Publication date: 1 February 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53887-6_16

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Security analysis of NIST CTR-DRBG, TNT: how to tweak a block cipher

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
• On the Indifferentiability of Key-Alternating 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
• Multi-instance Security and Its Application to Password-Based Cryptography
• Security Analysis of Key-Alternating Feistel Ciphers
• A Provable-Security Analysis of Intel’s Secure Key RNG
• Multi-key Security: The Even-Mansour Construction Revisited
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
• Tight Security Bounds for Key-Alternating Ciphers
• How to protect DES against exhaustive key search (an analysis of DESX).