6:51

Welcome to Eurocrypt 2019, Marc Fischlin

IACR

55:02

Differential Privacy and the People's Data

IACR

1:04:05

Towards an Open Approach to Secure Cryptographic Implementations (François-Xavier Standaert)

IACR

1:02:31

Fully Homomorphic Encryption from the Ground Up

IACR

27:09

Efficient Verifiable Delay Functions

IACR

20:21

Efficient Circuit-Based PSI with Linear Communication

IACR

29:46

Symbolic Encryption with Pseudorandom Keys

IACR

20:47

Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear...

IACR

26:01

Ring Signatures: Logarithmic-Size, No Setup—from Standard Assumptions

IACR

21:04

A Modular Treatment of Blind Signatures from Identification Schemes

IACR

26:16

On ELFs, Deterministic Encryption, and Correlated-Input Security

IACR

28:39

Quantum Lightning Never Strikes the Same State Twice

IACR

28:05

SeaSign: Compact Isogeny Signatures from Class Group Actions

IACR

11:04

Reusable Designated-Verifier NIZKs for all NP from CDH

IACR

14:09

Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions

IACR

19:39

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More

IACR

25:10

Approx-SVP in Ideal Lattices with Pre-processing

IACR

20:21

The General Sieve Kernel and New Records in Lattice Reduction

IACR

21:38

Misuse Attacks on Post-quantum Cryptosystems

IACR

25:18

An Algebraic Approach to Maliciously Secure Private Set Intersection

IACR

27:01

On Quantum Advantage in Information Theoretic Single-Server PIR

IACR

22:14

Secret-Sharing Schemes for General and Uniform Access Structures

IACR

20:04

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

IACR

30:02

Simple Schemes in the Bounded Storage Model

IACR

28:57

From Collisions to Chosen-Prefix Collisions Application to Full SHA-1

IACR

21:11

Preimage Attacks on Round-Reduced Keccak-224/256 via an Allocating Approach

IACR

21:41

bison Instantiating the Whitened Swap-Or-Not Construction

IACR

28:46

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing

IACR

27:06

New Techniques for Obfuscating Conjunctions

IACR

23:36

Distributional Collision Resistance Beyond One-Way Functions

IACR

25:23

Multi-target Attacks on the Picnic Signature Scheme and Related Protocols

IACR

18:47

Durandal: A Rank Metric Based Signature Scheme

IACR

24:13

Lower Bounds for Differentially Private RAMs

IACR

20:22

Beyond Birthday Bound Secure MAC in Faulty Nonce Model

IACR

21:31

Tight Time-Memory Trade-Offs for Symmetric Encryption

IACR

25:14

Non-Malleable Codes Against Bounded Polynomial Time Tampering

IACR

25:10

Continuous Non-Malleable Codes in the 8-Split-State Model

IACR

21:53

Correlated-Source Extractors and Cryptography with Correlated-Random Tapes

IACR

28:25

Revisiting Non-Malleable Secret Sharing

IACR

25:05

Multi-party Virtual State Channels

IACR

20:01

Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble

IACR

31:57

Consensus Through Herding

IACR

20:50

Homomorphic Secret Sharing from Lattices Without FHE

IACR

21:52

Improved Bootstrapping for Approximate Homomorphic Encryption

IACR

16:37

Minicrypt Primitives with Algebraic Structure and Applications

IACR

23:33

Attacks only Get Better: How to Break FF3 on Large Domains

IACR

25:51

Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT

IACR

23:51

An Analysis of NIST SP 800-90A

IACR

25:02

Computationally Volume-Hiding Structured Encryption

IACR

20:32

Locality-Preserving Oblivious RAM

IACR

23:06

Private Anonymous Data Access

IACR

22:38

Reversible Proofs of Sequential Work

IACR

23:12

Incremental Proofs of Sequential Work

IACR

28:39

Tight Proofs of Space and Replication

IACR

23:10

Founding Secure Computation on Blockchains

IACR

25:22

Uncovering Algebraic Structures in the MPC Landscape

IACR

22:35

Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies

IACR

23:19

A Quantum-Proof Non-malleable Extractor

IACR

17:03

A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness M...

IACR

13:12

Degree 2 is Complete for the Round-Complexity of Malicious MPC

IACR

18:28

Two Round Information-Theoretic MPC with Malicious Security

IACR

14:21

Designated-Verifier Pseudorandom Generators, and Their Applications

IACR