On-line ciphers and the Hash-CBC constructions
From MaRDI portal
Publication:1928770
DOI10.1007/S00145-011-9106-1zbMath1286.94058OpenAlexW2016250398WikidataQ56933158 ScholiaQ56933158MaRDI QIDQ1928770
Lars R. Knudsen, Mihir Bellare, Alexandra Boldyreva, Chanathip Namprempre
Publication date: 4 January 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9106-1
Related Items (8)
Efficient Boolean search over encrypted data with reduced leakage ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Full Disk Encryption: Bridging Theory and Practice ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers ⋮ Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption ⋮ Online Ciphers from Tweakable Blockciphers ⋮ Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC ⋮ Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Online Ciphers from Tweakable Blockciphers
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Software Performance of Universal Hash Functions
- Advances in Cryptology - CRYPTO 2003
- Blockwise-Adaptive Chosen-Plaintext Attack and Online Modes of Encryption
- A Simple and Unified Method of Proving Indistinguishability
- Selected Areas in Cryptography
- Topics in Cryptology – CT-RSA 2004
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: On-line ciphers and the Hash-CBC constructions
