Results 11 to 20 of about 94,502 (210)
Tweakable Blockciphers with Beyond Birthday-Bound Security [PDF]
IACR Cryptology ePrint Archive, 2012 Liskov, Rivest and Wagner formalized the tweakable blockcipher TBC primitive at CRYPTO'02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then build up a construction that admits a tweak. Almost all such constructions enjoy provable security only to the birthday bound, and the one that does achieve security beyond the ...
Will Landecker +2 more
openaire +2 more sources
Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs
IACR Cryptology ePrint Archive, 2023 At CRYPTO’18, Datta et al. proposed nPolyMAC and proved the security up to 22𝑛/3 authentication queries and 2𝑛 verification queries. At EUROCRYPT’19, Dutta et al. proposed CWC+ and showed the se- curity up to 22𝑛/3 queries. At FSE’19, Datta et al. proposed PolyMAC and its key-reduced variant 2k-PolyMAC, and showed the security up to 22𝑛/3 queries. This
Shen, Yaobin +3 more
openaire +3 more sources
On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks [PDF]
Cryptography and Communications, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthias Hamann, Matthias Krause
openaire +4 more sources
Security of the Misty Structure beyond the Birthday Bound [PDF]
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014 In this paper, we first prove beyond-birthyday-bound security for the Misty structure. Specifically, we show that an r-round Misty structure is secure against CCA attacks up to O(2 rn r+7 ) query complexity, where n is the size of each round permutation.
Jooyoung Lee
openaire +2 more sources
Short Variable Length Domain Extenders with Beyond Birthday Bound Security
IACR Cryptology ePrint Archive, 2018 Length doublers are cryptographic functions that transform an n-bit cryptographic primitive into an efficient and secure cipher that length-preservingly encrypts strings of length in \([n,2n-1]\). All currently known constructions are only proven secure up to the birthday bound, and for all but one construction this bound is known to be tight.
Chen, Y.L., Mennink, B., Nandi, M.
openaire +3 more sources
Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption
IACR Cryptology ePrint Archive, 2020 Fresh rekeying is a well-established method to protect a primitive or mode against side-channel attacks: an easy to protect but cryptographically not so involved function generates a subkey from the master key, and this subkey is then used for the block encryption of a single or a few messages. It is an efficient way to achieve side-channel protection,
Bart Mennink
openaire +3 more sources
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security [PDF]
Fast Software Encryption Workshop, 2006 In this paper, we define and analyze a new blockcipher mode of operation for encryption, CENC, which stands for Cipher-based ENCryption. CENC has the following advantages: (1) beyond the birthday bound security, (2) security proofs with the standard PRP assumption, (3) highly efficient, (4) single blockcipher key, (5) fully parallelizable, (6) allows ...
Tetsu Iwata
openaire +2 more sources
Permutation-Based Hashing Beyond the Birthday Bound
IACR Transactions on Symmetric CryptologyIt is known that the sponge construction is tightly indifferentiable from a random oracle up to around 2c/2 queries, where c is the capacity. In particular, it cannot provide generic security better than half of the underlying permutation size.
Charlotte Lefevre, Bart Mennink
doaj +2 more sources
GCM Variants with Robust Initialization Vectors
Mathematics, 2023 The complexity and isomerization of communication networks have put forth new requirements for cryptographic schemes to ensure the operation of network security protocols. Robust cryptographic schemes have been gradually favored.
Ping Zhang
doaj +1 more source
Categorization of Faulty Nonce Misuse Resistant Message Authentication [PDF]
, 2021 A growing number of lightweight block ciphers are proposed for environments such as the Internet of Things. An important contribution to the reduced implementation cost is a block length n of 64 or 96 bits rather than 128 bits.
Bart Mennink, Bart Preneel, Yu Long Chen
core +1 more source