Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC

DOI10.1007/978-3-540-89754-5_27zbMath1203.94117OpenAlexW2162236402MaRDI QIDQ5504635

Mridul Nandi

Publication date: 22 January 2009

Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89754-5_27

zbMATH Keywords

random permutationCBCuniversal hash functiononline cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Full Disk Encryption: Bridging Theory and Practice ⋮ \textsc{POEx}: a beyond-birthday-bound-secure on-line cipher ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers ⋮ On the optimality of non-linear computations for symmetric key primitives ⋮ Online Ciphers from Tweakable Blockciphers ⋮ Revisiting construction of online cipher in hash-ECB-hash structure ⋮ MCBC ⋮ Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decorrelation: a theory for block cipher security
• On-line ciphers and the Hash-CBC constructions
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Software Performance of Universal Hash Functions
• Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC

This page was built for publication: Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC