1:18:01

s-4: LWE and Encryption

9:06

s-1: Opening Remarks for TCC 2020

1:07:36

s-102: Workshop: Matches made in heaven: Cryptography and Theoretical Computer Science

25:33

On Perfect Correctness in (Lockable) Obfuscation

6:36

s-48: FSE 2020 Closing Remarks

28:26

s-53: Ask Me Anything (AMA), with Kaisa Nyberg

1:03:16

s-30: Cryptanalysis of block ciphers

1:03:11

s-26: Security Proofs

59:16

s-28: Cryptanalysis of Hash Functions, PRFs and PRGs

20:26

Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More

15:37

Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions

22:12

Expected Constant Round Byzantine Broadcast under Dishonest Majority

26:11

Universal Composition with Global Subroutines: Capturing Global Setup within plain UC

1:10:16

s-24: NIST Lightweight Standardisation III

1:02:36

s-20: Invited Talk (Thomas Peyrin)

1:07:18

s-22: Tools for Cryptanlysis

25:03

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads

28:10

Topology-Hiding Communication from Minimal Assumptions.

23:56

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interactio...

24:02

Towards Multiparty Computation Withstanding Coercion of All Parties

27:44

Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness

21:30

Super-Linear Time-Memory Trade-Offs for Symmetric Encryption

27:06

Secure Quantum Extraction Protocols

23:19

Perfect Zero Knowledge: New Upperbounds and Relativized Separations

19:41

On Average-Case Hardness in TFNP from One-Way Functions

23:09

On the Round Complexity of the Shuffle Model

26:42

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors

26:43

Security analysis of SPAKE2+

24:28

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation

25:47

Batch Verification and Proofs of Proximity with Polylog Overhead

23:20

Secure Massively Parallel Computation for Dishonest Majority

23:52

FHE-Based Bootstrapping of Designated-Prover NIZK

17:29

Multi-key Fully-Homomorphic Encryption in the Plain Model

21:14

Towards Non-Interactive Witness Hiding

29:59

Lossiness and Entropic Hardness for Ring-LWE

19:19

On the Security of Time-Lock Puzzles and Timed Commitments

26:31

Lower Bounds for Multi-Server Oblivious RAMs

20:22

Asynchronous Byzantine Agreement with Subquadratic Communication

24:37

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity

17:26

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions

22:51

On Computational Shortcuts for Information-Theoretic PIR

23:49

Transparent Error Correcting in a Computationally Bounded World

24:28

Reusable Two-Round MPC from DDH

22:10

Round Optimal Secure Multiparty Computation from Minimal Assumptions

29:34

Ledger Combiners for Fast Settlement

25:46

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

23:11

Blockchains from Non-Idealized Hash Functions

21:14

Classical Verification of Quantum Computations with Efficient Verifier

28:57

Continuous Group Key Agreement with Active Security

29:27

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions

15:07

Weakly Extractable One-Way Functions

25:09

NIZK from SNARG

20:30

Zero-Communication Reductions

20:10

Characterizing Deterministic-Prover Zero Knowledge

21:35

Synchronous Constructive Cryptography

25:33

On the Power of an Honest Majority in Three-Party Computation Without Broadcast

21:21

Non-interactive classical verification of quantum computation

18:03

Stronger Security and Constructions of Multi-Designated Verifier Signatures

28:13

On the Price of Concurrency in Group Ratcheting Protocols

25:48

Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures

18:40

Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity

20:42

Coupling of Random Systems

21:41

Batch Verification for Statistical Zero Knowledge Proofs

23:23

The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs

18:50

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

20:44

Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)

25:15

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model

23:40

CP-ABE for Circuits (and more) in the Symmetric Key Setting

19:17

On Statistical Security in Two-Party Computation

22:12

Quantum encryption with certified deletion

17:31

New Techniques in Replica Encodings with Client Setup

24:41

Can a Blockchain Keep a Secret?

24:21

A Lower Bound for One-Round Oblivious RAM

22:49

Schr{\"o}dinger's Pirate: How To Trace a Quantum Decoder

25:34

Barriers for Succinct Arguments in the Random Oracle Model

19:48

Linear-Time Arguments with Sublinear Verification from Tensor Codes

26:31

Proof-Carrying Data from Accumulation Schemes

18:16

On the Complexity of Arithmetic Secret Sharing

17:30

On Pseudorandom Encodings

23:16

Non-Malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition o...

55:06

s-18: FSE 2020 Rump session

57:41

s-16: NIST Lightweight Standardisation II

31:16

s-50: New Constructions

29:46

s-14: S-boxes

1:11:51

s-12: Stream Ciphers

1:00:36

s-8: Invited Talk (Kazuhiko Minematsu)

1:00:36

s-10: Authenticated Encryption

35:41

s-51: Ask Me Anything (AMA), with Joan Daemen

1:09:56

s-49: Message Authentication Codes

58:46

s-4: Building Blocks: Linear Layers

1:11:41

s-2: FSE 2020 Opening Remarks + NIST Lightweight Standardisation I

18:06

Security under Message-Derived Keys: Signcryption in iMessage

20:12

Beyond-Birthday-Bound Secure Cryptographic Permutations from Ideal Ciphers with Long Keys

20:37

ZOCB and ZOTR: Tweakable Blockcipher Modes for Authenticated Encryption with Full Absorption

19:57

Reconstructing an S-box from its Difference Distribution Table

21:56

Swap and Rotate: Lightweight Linear Layers for SPN-based Blockciphers

21:09

Multiple Linear Cryptanalysis Using Linear Statistics

13:30

Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack...

22:12

Cryptanalysis of Curl-P and Other Attacks on the IOTA Cryptocurrency

15:45

Exploring Secret Keys in Searching Integral Distinguishers Based on Division Property