Results 11 to 20 of about 94,493 (210)

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, Standaert, François-Xavier, Lei Wang, 29th International Conferenceon the Theory and Application of Cryptology and Information Security   +3 more
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

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

Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security

IACR Transactions on Symmetric Cryptology, 2017
Modular design via a tweakable blockcipher (TBC) offers efficient authenticated encryption (AE) schemes (with associated data) that call a blockcipher once for each data block (of associated data or a plaintext).
Yusuke Naito
doaj   +2 more sources

Permutation-Based Hashing Beyond the Birthday Bound

IACR 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   +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

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

IET 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

IACR 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, Mridul Nandi, Suprita Talnikar   +2 more
doaj   +1 more source

‘Staying Close’: Enabling social interdependence for young people leaving residential care in England

Children &Society, EarlyView., 2023
Abstract Applying social interdependence theory as a framework for document analysis, this paper considers eight evaluations of an extended care scheme in England known as ‘Staying Close’. Findings suggest that for extended care projects like ‘Staying Close’ to work, any service offer designed to support the transition from residential care to ...
Dan Allen
wiley   +1 more source