Results 11 to 20 of about 4,552,353 (162)
Tweakable Blockciphers with Beyond Birthday-Bound Security [PDF]
, 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
GCM-SIV1.5: Optimal Tradeoff between GCM-SIV1 and GCM-SIV2 [PDF]
Entropy, 2023 GCM-SIV2 is a nonce-based beyond-birthday-bound (BBB)-secure authenticated encryption (AE) mode introduced by Iwata and Minematsu at FSE 2017. However, it is built by combining two instances of GCM-SIV1 and needs eight keys, which increases the costs of ...
Ping Zhang
doaj +2 more sources
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security [PDF]
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 [PDF]
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 +5 more sources
Rugged Pseudorandom Permutations with Beyond-Birthday-Bound Security [PDF]
Proceedings of the ACM Asia Conference on Computer and Communications SecurityA 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
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
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
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 +1 more source