Results 131 to 140 of about 4,552,353 (162)

The Multiple Layers of Childhood Adversity and Premature Mortality: Synthesizing Life-course Data on Individual, Family and Neighborhood Adversity in 1.2 million individuals

Rod N, Bennetsen S, Elsenburg L, Sabel C, Taylor-Robinson D, Kovacs D, Zucco A, Vries T.   +7 more
europepmc   +1 more source

Conference abstracts the 1st UDOM scientific conference on health: healthy lives and well-being for all: opportunities and challenges. [PDF]

BMC Proc
europepmc   +1 more source

One-Key Compression Function Based MAC with Security Beyond Birthday Bound [PDF]

Lecture Notes in Computer Science, 2016
Gaži et al. [CRYPTO 2014] analyzed the NI-MAC construction proposed by An and Bellare [CRYPTO 1999] and gave a tight birthday-bound of $$O\ell q^{2}/2^{n}$$, as an improvement over the previous bound of $$O\ell ^{2}q^{2}/2^{n}$$. In this paper, we design a simple extension of NI-MAC, called $$\mathrm{NI}^{+}$$-MAC, and prove that it has security bound ...
Mridul Nandi, Goutam Paul, Avijit Dutta   +2 more
exaly   +5 more sources

Forgery Attacks on Several Beyond-Birthday-Bound Secure MACs [PDF]

Lecture Notes in Computer Science, 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.
François-Xavier Standaert
exaly   +6 more sources

XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation

Lecture Notes in Computer Science, 2023
We present a new block cipher mode of operation for authenticated encryption (AE), dubbed XOCB, that has the following features: (1) beyond-birthday-bound (BBB) security based on the standard pseudorandom assumption of the internal block cipher if the ...
Jooyoung Lee, Akiko Inoue, Kazuhiko Minematsu   +2 more
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-user Setting

Lecture Notes in Computer Science, 2021
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’19), and then Kim et al. (Eurocrypt’20) prove that DbHtS constructions are secure beyond the birthday bound in the single-user setting. However, by a generic
Dawu Gu, Jian Weng
exaly   +2 more sources