A Domain Extender for the Ideal Cipher

DOI10.1007/978-3-642-11799-2_17zbMath1274.94054OpenAlexW1529672696MaRDI QIDQ3408200

Jean-Sébastien Coron, Yannick Seurin, Yevgeniy Dodis, Avradip Mandal

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_17

zbMATH Keywords

indifferentiabilityideal cipher modeltweakable block-cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Tweak-Length Extension for Tweakable Blockciphers ⋮ Beyond-birthday security for permutation-based Feistel networks ⋮ Asymmetric PAKE with low computation \textit{and} communication ⋮ Partition and mix: generalizing the swap-or-not shuffle ⋮ Improved domain extender for the ideal cipher ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff ⋮ RIV for Robust Authenticated Encryption ⋮ Building blockcipher from small-block tweakable blockcipher ⋮ The Oribatida v1.3 family of lightweight authenticated encryption schemes ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ Indifferentiability for public key cryptosystems ⋮ TNT: how to tweak a block cipher

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Distinguisher and Related-Key Attack on the Full AES-256
• Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• Invertible Universal Hashing and the TET Encryption Mode
• A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Short Signatures in the Random Oracle Model
• Advances in Cryptology - CRYPTO 2003
• Message Authentication on 64-Bit Architectures
• Merkle-Damgård Revisited: How to Construct a Hash Function
• The Security of the Extended Codebook (XCB) Mode of Operation
• HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach
• Information Security and Cryptology
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2004
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003
• How to protect DES against exhaustive key search (an analysis of DESX).

This page was built for publication: A Domain Extender for the Ideal Cipher