Results 21 to 30 of about 94,502 (210)
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 +2 more
doaj +1 more source
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
Iterative Block Ciphers from Tweakable Block Ciphers with Long Tweaks
IACR Transactions on Symmetric Cryptology, 2020 We consider a problem of constructing a secure block cipher from a tweakable block cipher (TBC) with long tweaks. Given a TBC with n-bit blocks and Γn-bit tweaks for Γ ≥ 1, one of the constructions by Minematsu in DCC 2015 shows that a simple iteration ...
Ryota Nakamichi, Tetsu Iwata
doaj +1 more source
Generalized Feistel Structures Based on Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2022 A generalized Feistel structure (GFS) is a classical approach to construct a block cipher from pseudorandom functions (PRFs). Coron et al. at TCC 2010 instantiated a Feistel structure with a tweakable block cipher (TBC), and presented its provable ...
Kazuki Nakaya, Tetsu Iwata
doaj +1 more source
Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting [PDF]
, 2022 Double-block Hash-then-Sum (DbHtS) MACs are a class of MACs that aim for achieving beyond-birthday-bound security, including SUM-ECBC, PMAC\_Plus, 3kf9 and LightMAC_Plus. Recently Datta et al. (FSE\u2719), and then Kim et al. (Eurocrypt\u2720) prove that
Dawu Gu +3 more
core
Tight Security Analysis of EHtM MAC
IACR Transactions on Symmetric Cryptology, 2017 The security of a probabilistic Message Authentication Code (MAC) usually depends on the uniqueness of the random salt which restricts the security to birthday bound of the salt size due to the collision on random salts (e.g XMACR).
Avijit Dutta, Ashwin Jha, Mridul Nandi
doaj +1 more source
AES-LBBB: AES Mode for Lightweight and BBB-Secure Authenticated Encryption
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, a new lightweight authenticated encryption scheme AESLBBB is proposed, which was designed to provide backward compatibility with advanced encryption standard (AES) as well as high security and low memory.
Yusuke Naito +2 more
doaj +1 more source
Tight Security of TNT: Reinforcing Khairallah\u27s Birthday-bound Attack [PDF]
, 2023 In a recent paper, Khairallah demonstrated a birthday-bound attack on TNT, thereby invalidating its (beyond-the-birthday-bound) CCA security claims. In this short note, we reestablish a birthday-bound CCA security bound for TNT.
Abishanka Saha, Ashwin Jha, Mridul Nandi
core
Random Oracles in a Quantum World [PDF]
, 2011 The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett +25 more
core +3 more sources