27:35

Cryptanalysis Results on Spook: Bringing Full-round Shadow-512 to the Light

22:27

Universally Composable Relaxed Password Authenticated Key Exchange

16:43

Black-Box Transformations from Passive to Covert Security with Public Verifiability

17:17

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model

21:27

A Classification of Computational Assumptions in the Algebraic Group Model

25:57

Order-Fairness for Byzantine Consensus

24:49

Guaranteed Output Delivery Comes Free in Honest Majority MPC

21:13

Functional Encryption for Attribute-Weighted Sums from k-Lin

23:52

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions

21:31

Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF

25:09

The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More

34:22

Out of Oddity -- New Cryptanalytic Techniques against Symmetric Primitives Optimized for Integr...

23:08

Practical Product Proofs for Lattice Commitments

25:03

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging

23:01

Nearly Optimal Robust Secret Sharing against Rushing Adversaries

25:57

Verifiable Registration-Based Encryption

21:13

Lattice-Based Blind Signatures, Revisited

24:56

A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformati...

19:50

Collusion Resistant Watermarkable PRFs from Standard Assumptions

24:49

Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model

22:27

Fast reduction of algebraic lattices over cyclotomic fields

21:14

Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback

28:41

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All ...

24:48

New Constructions of Hinting PRGs, OWFs with Encryption, and more

26:10

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

24:37

Incompressible Encodings

22:32

The Memory-Tightness of Authenticated Encryption

16:46

The Summation-Truncation Hybrid: Reusing Discarded Bits for Free

19:05

Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting)

25:14

Random Probing Security: Verification, Composition, Expansion and New Constructions

23:47

Quantifying the Security Cost of Migrating Protocols to Practice

23:40

Handling Adaptive Compromise for Practical Encryption Schemes

24:23

Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages

24:39

Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path

17:50

MPC with Friends and Foes

28:18

Scalable Pseudorandom Quantum States

21:22

Fast and Secure Updatable Encryption

26:08

Leakage-Resilient Key Exchange and Two-Seed Extractors

17:30

Mode-Level vs. Implementation-Level Physical Security in Symmetric Cryptography: A Practical Gu...

25:04

Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees

18:56

Slide Reduction, Revisited—Filling the Gaps in SVP Approximation

21:54

Amplifying the Security of Functional Encryption, Unconditionally

21:26

Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme

27:59

Two-Sided Malicious Security for Private Intersection-Sum with Cardinality

26:54

Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing

25:01

New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Intera...

24:43

Random Self-reducibility of Ideal-SVP via Arakelov Random Walks

26:35

Rounding in the Rings

24:33

Adaptively Secure Constrained Pseudorandom Functions in the Standard Model

24:25

Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP

23:48

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k...

24:56

Cryptanalytic Extraction of Neural Network Models

25:08

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

22:03

Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields

15:48

The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers

25:11

Interactive Proofs for Social Graphs

19:45

Round-optimal Black-box Commit-and-prove with Succinct Communication

21:54

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge

19:38

A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem

28:56

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth ...

21:37

Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics

21:02

Automatic Verification of Differential Characteristics: Application to Reduced Gimli

22:29

Indifferentiability for Public Key Cryptosystems

20:35

LWE with Side Information: Attacks and Concrete Security Estimation

15:38

Security Analysis of NIST CTR-DRBG

25:36

New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings

24:51

Firmware Insider: Bluetooth Randomness is Mostly Random

34:48

Practical Decryption exFiltration: Breaking PDF Encryption

34:20

TPM-FAIL: TPM meetings Timing and Lattice Attacks

45:50

LadderLeak

42:47

Weaknesses in the Moscow Internet voting system

37:03

BIAS + KNOB attack against Bluetooth

29:14

Pseudorandom Black Swans: Cache Attacks on CTR_DRBG

1:00:48

s-189 Cryptanalysis and Concrete Security + Closing Remarks

49:00

s-187 Lattice Based Cryptography

1:02:59

s-185 Cryptographic Primitives

55:46

s-167 Multiparty Protocols, Secure Computation and Related Primitives

32:56

s-169 PKC Test of Time Award Ceremony

48:37

s-170 Post Quantum Cryptography

1:04:45

s-158 Invited Talk

1:04:22

s-161 Proofs and Arguments

1:15:35

s-154 Encryption Schemes and Secure Channels

1:22:31

s-148 Welcome + Functional Encryption and Identity Based Encryption

25:53

Witness Maps and Applications

22:43

Blazing Fast OT for Three-Round UC OT Extension

22:59

Sublinear-Round Byzantine Agreement Under Corrupt Majority

27:25

Updateable Inner Product Argument with Logarithmic Verifier and Applications

31:32

Generic Authenticated Key Exchange in the Quantum Random Oracle Model

14:43

Memory-Tight Reductions for Practical Key Encapsulation Mechanisms

26:36

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control

20:46

Verifiable Inner Product Encryption Scheme

19:16

Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Funct...

17:28

MPSign: A Signature from Small-Secret Middle-Product Learning with Errors

23:37

Threshold Ring Signatures: New Definitions and Post-quantum Security

25:02

A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials

26:08

Toward RSA-OAEP Without Random Oracles

25:34

PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Stan...

23:35

On QA-NIZK in the BPK Model

21:39

Hierarchical Identity-Based Encryption with Tight Multi-challenge Security

21:51

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography