On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
type: Item
instance of: scholarly article
title: On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
zbMATH Open document ID: 1387.94086
author: Ashwin Jha
author: Mridul Nandi
published in: Cryptography and Communications
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6875335
zbMATH Keywords: provable security
zbMATH Keywords: online cipher
zbMATH Keywords: tweakable block cipher
zbMATH Keywords: POEx
zbMATH Keywords: XTX
zbMATH Keywords: XTC
cites work: COBRA
cites work: Pipelineable On-line Encryption
cites work: Universal hashing and authentication codes
cites work: Combinatorial techniques for universal hashing
cites work: Parallelizable and Authenticated Online Ciphers
cites work: COBRA: A Parallelizable Authenticated Online Cipher Without Block Cipher Inverse
cites work: On-line ciphers and the Hash-CBC constructions
cites work: The security of the cipher block chaining message authentication code
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Q4941857
cites work: Topics in Cryptology – CT-RSA 2004
cites work: ELmD: A Pipelineable Authenticated Encryption and Its Hardware Implementation
cites work: Universal classes of hash functions
cites work: ELmE: A Misuse Resistant Parallel Authenticated Encryption
cites work: McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes
cites work: \textsc{POEx}: a beyond-birthday-bound-secure on-line cipher
cites work: Codes Which Detect Deception
cites work: MMH: Software message authentication in the Gbit/second rates
cites work: Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
cites work: Message Authentication on 64-Bit Architectures
cites work: Tweakable block ciphers
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Insuperability of the standard versus ideal model gap for tweakable blockcipher security
cites work: Tweak-Length Extension for Tweakable Blockciphers
cites work: Two New Efficient CCA-Secure Online Ciphers: MHCBC and MCBC
cites work: On the Minimum Number of Multiplications Necessary for Universal Hash Functions
cites work: Fast evaluation of polynomials by rational preparation
cites work: Online Ciphers from Tweakable Blockciphers
cites work: A new multi-linear universal hash family
cites work: New hash functions and their use in authentication and set equality
cites work: A New Algorithm for Inner Product
describes a project that uses: COBRA
describes a project that uses: POEx
describes a project that uses: MCBC
describes a project that uses: ELmE
describes a project that uses: ELmD
describes a project that uses: McOE
describes a project that uses: MMH
MaRDI profile type: Publication
Wikidata QID: Q121009644
full work available at URL: s12095-017-0275-0
OpenAlex ID: W2781953554
DOI: 10.1007/S12095-017-0275-0
description: scientific article; zbMATH DE number 6875335