26:08

Quadratic Secret Sharing and Conditional Disclosure of Secrets

26:35

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunction...

26:33

On the Possibility of Basing Cryptography on $\EXP \neq \BPP$

21:12

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\...

27:05

Targeted Lossy Functions and Applications

22:28

Thinking Outside the Superbox

25:20

Counterexamples to New Circular Security Assumptions Underlying iO

18:51

Computational Hardness of Optimal Fair Computation: Beyond Minicrypt

19:58

Non-Interactive Batch Arguments for NP from Standard Assumptions

25:02

Fluid MPC: Secure Multiparty Computation with Dynamic Participants

21:37

Improved Computational Extractors and their Applications

24:27

Hidden Cosets and Applications to Unclonable Cryptography

24:22

Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes

18:03

Adaptive Extractors and their Application to Leakage Resilient Secret Sharing

24:13

Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE

35:16

Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election

27:41

Oblivious Key-Value Stores and Amplification for Private Set Intersection

24:30

Composition with Knowledge Assumptions

20:59

You Only Speak Once: Secure MPC with Stateless Ephemeral Roles

20:58

How to Meet Ternary LWE Keys

20:54

Deniable Fully Homomorphic Encryption from Learning With Errors

27:06

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

23:54

On the Round Complexity of Black-Box Secure MPC

24:33

Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model

23:26

Lower bounds on lattice sieving and information set decoding

19:21

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

22:05

Traceable Secret Sharing and Applications

29:07

A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs

19:43

Towards Tight Random Probing Security

22:39

Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentratio...

27:42

DualRing: Generic Construction of Ring Signatures with Efficient Instantiations

22:48

MoSS: Modular Security Specifications Framework

24:30

Quantum Collision Attacks on Reduced SHA-256 and SHA-512

24:44

Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits

20:48

Multi-Input Quadratic Functional Encryption from Pairings

23:41

Oblivious RAM with Worst-Case Logarithmic Overhead

21:31

On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model

23:07

Efficient Key Recovery for all HFE Signature Variants

28:49

Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$

22:16

Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved

22:29

One-Way Functions Imply Secure Computation in a Quantum World

25:06

A Logarithmic Lower Bound for Oblivious RAM (for all parameters)

24:10

Compressing Proofs of k-Out-Of-n Partial Knowledge

21:22

Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks

25:18

Witness Authenticating NIZKs and Applications

20:25

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting

24:34

Provable Security Analysis of FIDO2

22:03

A Rational Protocol Treatment of 51% Attacks

22:43

New Approaches for Quantum Copy-Protection

25:21

On the Round Complexity of Secure Quantum Computation

20:51

Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings

34:55

Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwi...

20:43

Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficien...

19:48

Does Fiat-Shamir Require a Cryptographic Hash Function?

24:53

MuSig2: Simple Two-Round Schnorr Multi-Signatures

22:56

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

26:31

Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices

24:59

Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits

27:01

Linear Cryptanalysis of FF3-1 and FEA

17:43

Broadcast-Optimal Two Round MPC with an Honest Majority

23:16

Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques

24:18

Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Perfo...

26:31

Subquadratic SNARGs in the Random Oracle Model

25:13

On the Concurrent Composition of Quantum Zero-Knowledge

18:50

Fine-grained Secure Attribute-based Encryption

19:26

No Time to Hash:On Super-Efficient Entropy Accumulation

25:55

The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3

18:03

Secure Wire Shuffling in the Probing Model

18:37

Sumcheck Arguments and their Applications

19:29

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact

19:51

Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN

39:11

Raccoon Attack: Finding and Exploiting Most-Significant-Bit-Oracles in TLS-DH(E)

37:01

FragAttacks: Aggregation and Fragmentation Flaws in Wi-Fi

28:38

The Role of Integrity in Attestation and Isolation

14:19

A Side Journey To Titan

33:22

Baby Sharks: Small-Subgroup Attacks to Disrupt Large Distributed Systems

33:42

Partitioning Oracle Attacks

44:57

Fault Attacks on CCA-secure Lattice KEMs

28:34

PARASITE: PAssword Recovery Attack against Srp Implementations in ThE wild

47:54

s-22: Arguments and Proofs + Closing Remarks

1:09:14

s-20: Cryptographic Protocols and Secure Computation II

54:56

s-18: Lattice-based Cryptography

1:06:25

s-16: Invited Talk II (Eike Kiltz)

1:11:29

s-14: Cryptographic Primitives II

39:10

s-12: Functional Encryption and Attributed-based Encryption

1:07:09

s-10: Cryptographic Protocols and Secure Computation I

58:37

s-7: Cryptographic Primitives I

18:40

s-84: PKC Test of Time Awards

1:10:24

s-6: Signatures

1:00:07

s-4: Invited Talk I (Léo Ducas)

1:08:18

s-1: Opening Remarks + Post-Quantum Cryptography

25:04

On the (In)Security of the Diffie-Hellman Oblivious PRF with Multiplicative Blinding

18:29

Single-to-Multi-Theorem Transformations for Non-Interactive Statistical Zero-Knowledge

25:03

Isogeny-based key compression without pairings

22:57

Rate-1 Key-Dependent Message Security via Reusable Homomorphic Extractor against Correlated-S...

22:04

Transferable E-cash: A Cleaner Model and the First Practical Instantiation

21:19

On the CCA Compatibility of Public-Key Infrastructure

26:24

BETA: Biometric-Enabled Threshold Authentication

24:40

Masked Triples: Amortizing Multiplication Triples across Conditionals

23:26

Multi-Party Threshold Private Set Intersection with Sublinear Communication