Results 31 to 40 of about 4,552,363 (166)
Efficient Side-Channel Secure Message Authentication with Better Bounds
IACR Transactions on Symmetric Cryptology, 2020 We investigate constructing message authentication schemes from symmetric cryptographic primitives, with the goal of achieving security when most intermediate values during tag computation and verification are leaked (i.e., mode-level leakage-resilience).
Chun Guo +3 more
doaj +1 more source
Improved Security Bound of (E/D)WCDM
IACR Transactions on Symmetric Cryptology, 2021 In CRYPTO’16, Cogliati and Seurin proposed a block cipher based nonce based MAC, called Encrypted Wegman-Carter with Davies-Meyer (EWCDM), that gives 2n/3 bit MAC security in the nonce respecting setting and n/2 bit security in the nonce misuse setting ...
Nilanjan Datta +2 more
doaj +1 more source
Lightweight Authenticated Encryption Mode of Operation for Tweakable Block Ciphers
Transactions on Cryptographic Hardware and Embedded Systems, 2019 The use of a small block length is a common strategy when designing lightweight (tweakable) block ciphers (TBCs), and several 64-bit primitives have been proposed.
Yusuke Naito, Takeshi Sugawara
doaj +1 more source
IACR Transactions on Symmetric Cryptology, 2017 CAESAR has caused a heated discussion regarding the merits of one-pass encryption and online ciphers. The latter is a keyed, length preserving function which outputs ciphertext blocks as soon as the respective plaintext block is available as input.
Elena Andreeva +5 more
doaj +1 more source
New Constructions of MACs from (Tweakable) Block Ciphers
IACR Transactions on Symmetric Cryptology, 2017 We propose new constructions of Message Authentication Codes (MACs) from tweakable or conventional block ciphers. Our new schemes are either stateless and deterministic, nonce-based, or randomized, and provably secure either in the standard model for ...
Benoît Cogliati +2 more
doaj +1 more source
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher
IACR Transactions on Symmetric Cryptology, 2021 A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed.
Elena Andreeva +3 more
doaj +1 more source
IACR Transactions on Symmetric Cryptology, 2022 Stream ciphers are vulnerable to generic time-memory-data tradeoff attacks. These attacks reduce the security level to half of the cipher’s internal state size.
Matthias Hamann +3 more
doaj +1 more source
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
IACR Transactions on Symmetric Cryptology, 2018 SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al ...
Nilanjan Datta +3 more
doaj +1 more source
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 0001
openaire +4 more sources
International Journal of Eating Disorders, EarlyView.ABSTRACT Objective This study examined differences in mental health and well‐being, risk behaviors, suicidality, and social functioning across a proposed eating disorder (ED) spectrum, ranging from no ED symptoms to clinically diagnosed EDs. Methods We examined 44,303 participants in the 18‐year follow‐up in the Danish National Birth Cohort (DNBC‐18 ...
Anne V. Aurup +6 more
wiley +1 more source