Progress in Cryptology - INDOCRYPT 2004

DOI10.1007/b104579zbMath1113.94310OpenAlexW2475752160WikidataQ27991510 ScholiaQ27991510MaRDI QIDQ5712197

Shai Halevi

Publication date: 22 December 2005

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

Full work available at URL: https://doi.org/10.1007/b104579

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (23)

Automated proofs of block cipher modes of operation ⋮ Another look at XCB ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers ⋮ Designing tweakable enciphering schemes using public permutations ⋮ Implicit key-stretching security of encryption schemes ⋮ Tweakable enciphering schemes using only the encryption function of a block cipher ⋮ An Improved Security Bound for HCTR ⋮ Tweakable block ciphers ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Tweaking key-alternating Feistel block ciphers ⋮ On the optimality of non-linear computations for symmetric key primitives ⋮ Notions and relations for RKA-secure permutation and function families ⋮ A general mixing strategy for the ECB-Mix-ECB mode of operation ⋮ The Oribatida v1.3 family of lightweight authenticated encryption schemes ⋮ Tweakable Enciphering Schemes from Hash-Sum-Expansion ⋮ Online Ciphers from Tweakable Blockciphers ⋮ Breaking tweakable enciphering schemes using Simon's algorithm ⋮ \textsf{FAST}: disk encryption and beyond ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ The twin Diffie-Hellman problem and applications ⋮ Tweakable Pseudorandom Permutation from Generalized Feistel Structure

This page was built for publication: Progress in Cryptology - INDOCRYPT 2004