1:04:44

2016 IACR Distinguished Lecture: The future of cryptography by Bart Preneel

IACR

1:00:31

Protecting TLS from legacy crypto, Karthikeyan Bhargavan

IACR

23:33

Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model

IACR

24:16

Improved Progressive BKZ Algorithms and their Precise Cost Estimation by Sharp Simulator

IACR

58:16

Engineering Code Obfuscation

IACR

2:14:47

Eurocrypt 2016 Rump Session

IACR

44:10

IACR Business meeting, Eurocrypt 2016

IACR

1:00:01

Security Cryptography Implementations in Embedded Systems, Part 2.

IACR

57:20

Securing Cryptography Implementations in Embedded Systems, part I

IACR

23:39

New Attacks on the Concatenation and XOR Hash Combiners

IACR

22:29

Freestart Collision for Full SHA-1

IACR

22:49

Improved Differential-Linear Cryptanalysis of 7-round Chaskey with Partitioning

IACR

18:46

Constrained Pseudorandom Functions for Unconstrained Inputs

IACR

24:55

Fair and Robust MPC using a Global Transaction Ledger

IACR

24:35

Circuit Compilers with O(1/\\log (n)) Leakage Rate

IACR

28:30

Computationally Binding Quantum Commitments

IACR

19:46

Randomness Complexity of Private Circuits for Multiplication

IACR

25:10

Two Round Multiparty Computation via Multi-key FHE

IACR

25:30

Indifferentiability of Confusion-Diffusion Networks

IACR

24:04

Recovering Short Generators of Principal Ideals in Cyclotomic Rings, by oded regev

IACR

19:25

Structural Lattice Reduction: Generalized Worst-Case to Average-case Reductions and ...

IACR

22:48

Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance

IACR

1:50:51

CFRG Meeting

IACR

23:30

The Exact Round Complexity of Secure Computation

IACR

20:32

Unconditionally Secure Computation with Reduced Interaction

IACR

24:44

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key

IACR

25:36

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

IACR

25:15

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN

IACR

27:59

On the Size of Pairing-Based Non-interactive Arguments

IACR

22:42

Multi-input Functional Encryption in the Private-Key Setting: ...

IACR

27:59

Provably Robust Sponge-Based PRNGs and KDFs

IACR

24:49

Faster Algorithms for Solving LPN

IACR

23:27

Provably Weak Instances of Ring-LWE Revisited

IACR

25:32

Tightly CCA-Secure Encryption Without Pairings

IACR

26:00

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

IACR

24:37

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

IACR

28:07

Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts

IACR

21:33

Sanitization of FHE Ciphertexts

IACR

24:36

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

IACR

25:41

From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces

IACR

20:45

Zero-Knowledge Arguments for Lattice-Based Accumulators

IACR

25:25

Adaptively Secure Identity-Based Encryption from Lattices with ...

IACR

22:39

Online/Offline OR Composition of Sigma Protocols

IACR

25:31

On the Power of Hierarchical Identity-Based Encryption

IACR

24:16

Secure Computation from Elastic Noisy Channels

IACR

22:53

All Complete Functionalities are Reversible

IACR

24:40

On the Impossibility of Tight Cryptographic Reductions

IACR

16:51

New negative results on differing-inputs obfuscation

IACR