5:43

Key Words

4:52

DHE and the leading zeros in the premaster secret in TLS 1 1 1 2

2:52

Cryptanalyzing the Legendre PRF

2:20

decodingchallenge org

6:14

He Gives C Sieves on the CSIDH

5:03

Collusion Preserving Computation without a Mediator

2:16

Cards Against Cryptography

5:59

Implementing Signal

4:05

DARPA Cryptographic Research

2:25

International Olympiad in Cryptography NSUCRYPTO

3:07

Bringing Verifiable Delay Functions Into Production

5:33

Asymmetric distributed trust

5:02

Algebraically Structured LWE, Revisited

3:09

A new Paradigm Shift for the Crypto BlockChain Proof of Ability

5:21

48ce563f89a0ed9414f5aa28ad0d96d6795f9c62

24:32

Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs

23:40

Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption

20:00

Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilin...

23:24

Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge

20:52

Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs

21:20

Unifying Computational Entropies via Kullback–Leibler Divergence

23:35

The Distinction Between Fixed and Random Generators in Group-Based Assumptions

21:27

The Privacy Blanket of the Shuffle Model

22:11

Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge

22:55

On Round Optimal Statistical Zero Knowledge Arguments

22:12

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate En...

25:16

Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Ps...

18:56

Match Me if You Can: Matchmaking Encryption and Its Applications

18:54

ABE for DFA from k-Lin

23:12

Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE

22:45

Trapdoor Hash Functions and Their Applications

23:10

CCA Security and Trapdoor Functions via Key-Dependent-Message Security

25:33

It Wasn’t Me!

23:03

Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations

22:32

Watermarking Public-Key Cryptographic Primitives

30:44

Shared presentation at Crypto 2019

27:13

Shared presentation on Zero Knowledge at Crypto 2019

22:54

Memory-Hard Functions from Cryptographic Primitives

23:18

Broadcast and Trace with $$N^{\varepsilon }$$ Ciphertext Size from Standard Assumptions

22:24

Strong Asymmetric PAKE Based on Trapdoor CKEM

23:27

Highly Efficient Key Exchange Protocols with Optimal Tightness

26:28

Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions

23:28

Public-Key Cryptography in the Fine-Grained Setting

25:02

Cryptographic Sensing

23:30

Non-interactive Non-malleability from Quantum Supremacy

24:03

New Constructions of Reusable Designated-Verifier NIZKs

20:26

Exploring Constructions of Compact NIZKs from Various Assumptions

25:21

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More

26:12

Reusable Non-Interactive Secure Computation

26:33

Universally Composable Secure Computation with Corrupted Tokens

22:13

SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension

1:07:32

Invited talk: Contextual Integrity

23:27

On the Plausibility of Fully Homomorphic Encryption for RAMs

59:00

Invited talk: Secure computation: When theory meets...

20:33

Non-malleable Codes for Decision Trees

18:50

Explicit Rate-1 Non-malleable Codes for Local Tampering

23:18

Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space

23:54

Homomorphic Time-Lock Puzzles and Applications

20:42

Symmetric Primitives with Structured Secrets

23:36

Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations

23:36

Seedless Fruit Is the Sweetest: Random Number Generation, Revisited

18:21

Simple Proofs of Space-Time and Rational Proofs of Storage

19:27

How to Build Pseudorandom Functions from Public Random Permutations

21:17

Nonces Are Noticed: AEAD Revisited

21:25

Security in the Presence of Key Reuse: Context-Separable Interfaces and Their Applications

22:15

Unifying Leakage Models on a Rényi Day

22:56

Synchronous, with a Chance of Partition Tolerance

20:07

On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm

20:04

New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator

27:26

Joint Presentation on Lattices at Crypto 2019

23:53

Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Ap...

23:28

BEST YOUNG RESEARCHERS AWARD: Fully Secure Attribute-Based Encryption for t-CNF from LWE

21:38

BEST YOUNG RESEARCHERS AWARD: Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE

22:50

BEST PAPER AWARD: Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality

27:26

Shared presentation on Leakage-Resilient Secret Sharing at Crypto 2019.

21:23

Non-malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Re...

24:01

Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System

23:18

Unconditionally Secure Computation Against Low-Complexity Leakage

24:20

Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem

22:41

Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full $$\mathsf {MO...

22:54

Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning

17:37

Efficient Collision Attack Frameworks for RIPEMD-160

30:09

Shared presentation on Fiat-Shamir security at Crypto 2019

21:28

Quantum Indistinguishability of Random Sponges

26:28

Quantum Security Proofs Using Semi-classical Oracles

18:37

How to Record Quantum Queries, and Applications to Quantum Indifferentiability

19:43

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

23:34

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

24:31

Adaptively Secure MPC with Sublinear Communication Complexity

20:35

The Communication Complexity of Threshold Private Set Intersection

23:07

Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors

21:28

Proofs of Replicated Storage Without Timing Assumptions

22:57

On the Existence of 3-Round Zero-Knowledge Protocols

1:10:14

FSE 2019 Rump Session

20:16

libInterMAC: Beyond Confidentiality and Integrity in Practice

23:56

Towards Low Energy Stream Ciphers

28:17

Separable Statistics and Multidimensional Linear Cryptanalysis

15:59

Conditional Linear Cryptanalysis – Cryptanalysis of DES with Less Than 242 Complexity

19:46

Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials

22:10

Adiantum: length-preserving encryption for entry-level processors