Sign in to confirm you’re not a bot
This helps protect our community. Learn more

Introduction

0:23

Forgery Security Game

2:06

Case of ECBC

3:00

Birthday Bound Attack

4:24

Forgery from collision

4:45

Why Beyond Birthday Security?

6:02

SUM-ECBC [Yasuda, CT-RSA 2010]

7:29

PMAC Plus [Yasuda, CRYPTO 2011]

8:18

LightMAC Plus [Naito, ASIACRYPT 2017]

9:48

Summary so far

10:13

Abstract view of BBB Secure MACS: Double Block Hash-then-Sum (DbHtS)

10:47

Sum function is not a PRF

12:05

(Alternating) Cycle and Path

13:46

Security of DbHtS

14:10

Two-keyed DbHtS (with domain separation)

20:28

Security of two-keyed DbHtS with fixo, fix

22:08

Instantiations of three-keyed and two-keyed DbHtS

22:44

Tightness of the bound

24:42
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
N/ALikes
77Views
2019Sep 30
Paper by Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul presented at Fast Software Encryption Conference 2019 See https://iacr.org/cryptodb/data/paper....

Follow along using the transcript.

IACR

9.82K subscribers