3:19:04

Rump Session at Eurocrypt 2022

1:35:23

Session on Randomness

1:13:23

Session on Secure Multiparty Computation I

5:04

Opening Remarks at Crypto 2022

27:31

Implicit White Box Implementations White Boxing ARX Ciphers

22:14

Triangulating Rebound Attack on AES like Hashing

1:20:04

Session on Quantum Cryptography I

21:28

Multimodal Private Signatures

4:24

Succinct Classical Verification of Quantum Computation

4:59

Better than Advertised Security for Non-Interactive Threshold Signatures

5:45

A New Approach to Efficient Non-Malleable Zero-Knowledge

5:36

Superposition Meet-in-the-Middle Attacks: Updates on Fundamental Security of AES-like Ciphers

1:32

(Nondeterministic) Hardness vs. Non-Malleability

4:02

Structure-Aware Private Set Intersection, With Applications to Fuzzy Matching

8:05

Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round

5:06

Multi-Input Attribute Based Encryption and Predicate Encryption

5:14

Nova: Recursive Zero-Knowledge Arguments from Folding Schemes

3:37

Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions

4:24

Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resist...

5:03

log∗-Round Game-Theoretically-Fair Leader Election

5:19

Programmable Distributed Point Functions

5:28

Correlated Pseudorandomness from Expand-Accumulate Codes

5:42

Constructing and Deconstructing Intentional Weaknesses in Symmetric Ciphers

4:49

Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agree...

2:14

New Constructions of Collapsing Hashes

1:54

To Label, or Not To Label (in Generic Groups)

2:01

Augmented Random Oracles

4:56

Authenticated garbling from simple correlations

1:51

Faster Sounder Succinct Arguments and IOPs

5:03

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security

4:23

Le Mans: Dynamic and Fluid MPC for Dishonest Majority

5:36

Gossiping for Communication-Efficient Broadcast

5:42

A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via ...

5:13

A More Complete Analysis of the Signal Double Ratchet Algorithm

2:08

Practical Sublinear Proofs for R1CS from Lattices

4:10

Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work

3:48

Statistically Sender-Private OT From LPN and Derandomization

5:05

Differential Cryptanalysis in the Fixed-Key Model

5:14

Simplified MITM Modeling for Permutations: New (Quantum) Attacks

5:00

Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing

4:49

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

3:36

Quantum Commitments and Signatures without One-Way Functions

4:44

Tight Preimage Resistance of the Sponge Construction

4:34

Maliciously Secure Massively Parallel Computation for All-but-One Corruptions

4:59

Moz$\mathbb{Z}_{2^k}$zarella: Efficient Vector-OLE and Zero-Knowledge Proofs Over $\mathbb{Z}_{...

4:46

On the Feasibility of Unclonable Encryption and, More

3:00

Orion: Zero Knowledge Proof with Linear Prover Time

4:48

Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation

4:44

Certified Everlasting Zero-Knowledge Proof for QMA

5:12

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgard Hash Functions

4:39

Nearly Optimal Property Preserving Hashing

4:48

Oblivious Message Retrieval

4:04

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General

6:48

Securing Approximate Homomorphic Encryption using Differential Privacy

4:06

Accelerating the Delfs-Galbraith algorithm with fast subfield root detection

4:19

Succinct Interactive Oracle Proofs: Applications and Limitations

3:53

Triangulating Rebound Attack on AES-like Hashing

4:59

On the Impossibility of Key Agreements from Quantum Random Oracles

1:47

Constructive Post-Quantum Reductions

2:38

Secret Can Be Public: Low-Memory AEAD Mode for High-Order Masking

5:35

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

5:06

Provably Secure Reflection Ciphers

4:22

Formal Verification of Saber’s Public-Key Encryption Scheme in EasyCrypt

4:43

On Codes and Learning with Errors over Function Fields

5:14

Breaking Rainbow Takes a Weekend on a Laptop

4:37

Rotational Differential-Linear Distinguishers of ARX Ciphers with Arbitrary Output Linear Masks

4:56

Batch Arguments for NP and More from Standard Bilinear Group Assumptions

4:27

Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs

5:02

Some Easy Instances of Ideal-SVP and Implications to the Partial Vandermonde Knapsack Problem

5:12

Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM

4:18

Overloading the Nonce: Rugged PRPs, Nonce-Set AEAD, and Order-Resilient Channels

5:09

Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications

3:44

Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks

4:58

Block-Cipher-Based Tree Hashing

4:42

Password-Authenticated Key Exchange from Group Actions

4:57

On the Insider Security of MLS

2:10

Collision-Resistance from Multi-Collision-Resistance

4:25

Cryptography from Pseudorandom Quantum States

4:55

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions

5:13

Implicit White-Box Implementations: White-Boxing ARX Ciphers

4:09

Parallel Repetition of $(k_1,\dots,k_{\mu})$-Special-Sound Multi-Round Interactive Proofs

5:01

Improving Support-Minors rank attacks: applications to GeMSS and Rainbow

4:20

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU

5:04

Lower Bound on SNARGs in the Random Oracle Model

25:31

On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing

5:49

Threshold Signatures with Private Accountability

2:43

Practical Statistically-Sound Proofs of Exponentiation in any Group

4:37

PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More

4:31

Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions

21:05

Public-Key Watermarking Schemes for Pseudorandom Functions

6:43

MuSig-L: Lattice-Based Multi-Signature With Single-Round Online Phase

5:01

Short Leakage Resilient and Non-malleable Secret Sharing Schemes

5:06

Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with...

5:23

Shorter Hash-and-Sign Lattice-Based Signatures

4:35

Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications

6:17

Dynamic Local Searchable Symmetric Encryption

24:07

Online-Extractability in the Quantum Random-Oracle Model

25:44

Constant-round Blind Classical Verification of Quantum Sampling

28:27

Anonymous, Robust Post-Quantum Public Key Encryption

23:49

Authentication in the Bounded Storage Model