Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
From MaRDI portal
Publication:5504635
DOI10.1007/978-3-540-89754-5_27zbMATH Open1203.94117OpenAlexW2162236402MaRDI QIDQ5504635FDOQ5504635
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
Recommendations
Cites Work
- Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
- Title not available (Why is that?)
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decorrelation: a theory for block cipher security
- On-line ciphers and the Hash-CBC constructions
- Software Performance of Universal Hash Functions
Cited In (9)
- 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
- Title not available (Why is that?)
- Full Disk Encryption: Bridging Theory and Practice
- Online Ciphers from Tweakable Blockciphers
- MCBC
- Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
- Revisiting construction of online cipher in hash-ECB-hash structure
- \textsc{POEx}: a beyond-birthday-bound-secure on-line cipher
This page was built for publication: Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504635)