Results 11 to 20 of about 4,552,363 (166)

Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption [PDF]

open access: yesLecture Notes in Computer Science, 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
exaly   +5 more sources

Tweakable Blockciphers with Beyond Birthday-Bound Security [PDF]

open access: yes, 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   +4 more sources

New Blockcipher Modes of Operation with Beyond the Birthday Bound Security [PDF]

open access: yes, 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
core   +5 more sources

Security of the Misty Structure beyond the Birthday Bound [PDF]

open access: yesIEICE 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
core   +7 more sources

Permutation-Based Hashing Beyond the Birthday Bound [PDF]

open access: yesIACR Transactions on Symmetric Cryptology
It 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   +5 more sources

Cymric: Short-tailed but Mighty

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
Authenticated encryption (AE) is a fundamental tool in today’s secure communication. Numerous designs have been proposed, including well-known standards such as GCM.
Alexandre Adomnicăi   +4 more
doaj   +2 more sources

Rugged Pseudorandom Permutations with Beyond-Birthday-Bound Security [PDF]

open access: yesProceedings of the ACM Asia Conference on Computer and Communications Security
A rugged pseudorandom permutation (RPRP) is a security notion for variable-length tweakable ciphers that is strictly weaker than the traditional notion of a strong pseudorandom permutation.
Nilanjan Datta   +4 more
core   +4 more sources

GCM Variants with Robust Initialization Vectors

open access: yesMathematics, 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

Beyond full‐bit secure authenticated encryption without input‐length limitation

open access: yesIET Information Security, 2022
The security bound is an important evaluation criterion in an authenticated encryption (AE) scheme. Many AE schemes that are widely used have birthday‐bound security, which means that the scheme has b/2‐bit security, where b is the block size of the ...
Akiko Inoue
doaj   +1 more source

Permutation Based EDM: An Inverse Free BBB Secure PRF

open access: yesIACR Transactions on Symmetric Cryptology, 2021
In CRYPTO 2019, Chen et al. have initiated an interesting research direction in designing PRF based on public permutations. They have proposed two beyond the birthday bound secure n-bit to n-bit PRF constructions, i.e., SoEM22 and SoKAC21, which are ...
Avijit Dutta   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy