54:46

s-120: Encryption Schemes

1:33:31

s-3: Best paper award (Asiacrypt 2020)

1:03:01

s-2: Invited Talk by Shweta Agrawal

11:06

s-1: Opening remarks for Asiacrypt 2020

29:58

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin

20:44

Inner-Product Functional Encryption with Fine-Grained Access Control

26:52

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs

25:24

CCA Updatable Encryption Against Malicious Re-Encryption Attacks

20:45

Two-Pass Authenticated Key Exchange with Explicit Authentication and Tight Security

28:09

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

20:36

Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers

24:56

Unbounded Dynamic Predicate Compositions in ABE from Standard Assumptions

25:30

Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multipart...

25:27

Individual Simulations

23:12

On the Adaptive Security of MACs and PRFs

20:56

Succinct Diophantine-Satisfiability Arguments

26:05

Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices

13:38

Non-Interactive Composition of Sigma-Protocols via Share-then-Hash

22:07

Oblivious Pseudorandom Functions from Isogenies

24:44

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing

25:30

Quantum Circuit Implementations of AES with Fewer Qubits

19:58

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?

21:53

Circular Security Is Complete for KDM Security

26:11

Post-Quantum Verification of Fujisaki-Okamoto

20:09

Multi-Client Oblivious RAM with Poly-Logarithmic Communication

20:49

Catalic: Delegated PSI Cardinality with Applications to Contact Tracing

20:41

Packed Multiplication: How to Amortize the Cost of Side-channel Masking?

28:13

Security Limitations of Classical-Client Delegated Quantum Computing

30:01

How to Build Optimally Secure PRFs Using Block Ciphers

24:34

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z

24:06

Unbounded HIBE with Tight Security

21:17

Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption

22:30

Radical Isogenies

23:29

KVaC: Key-Value Commitments for Blockchains and Beyond

17:44

Improved Classical and Quantum Algorithms for Subset-Sum

31:38

Towards Closing The Security Gap of Tweak-aNd-Tweak (TNT)

26:19

Crowd Verifiable Zero-Knowledge and End-to-end Verifiable Multiparty Computation

24:55

Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices

15:28

A Combinatorial Approach to Quantum Random Functions

24:41

Cryptanalysis of Masked Ciphers: A not so Random Idea

27:39

Security Reductions for White-Box Key-Storage in Mobile Payments

23:19

Cryptographic Group Actions and Applications

21:09

Succinct Functional Commitment for a Large Class of Arithmetic Circuits

22:03

Secure MPC: Laziness Leads to GOD

23:42

Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems

22:49

Lower Bounds on the Degree of Block Ciphers

20:04

SILVER - Statistical Independence and Leakage Verification

23:13

Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications

26:42

Adaptively Secure Inner Product Encryption from LWE

20:16

An Algebraic Attack on Ciphers with Low-Degree Round Functions: Application to Full MiMC

26:29

Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions

21:13

MoniPoly---An Expressive $q$-SDH-Based Anonymous Attribute-Based Credential System

22:16

A Bit-Vector Differential Model for the Modular Addition by a Constant

18:54

CCA-Secure (Puncturable) KEMs from Encryption With Non-Negligible Decryption Errors

17:44

An Algebraic Formulation of the Division Property: Revisiting Degree Evaluations, Cube Attacks,...

11:18

Quantum Collision Attacks on AES-like Hashing with Low Quantum Random Access Memories

19:09

Tight Security Analysis of 3-Round Key-Alternating Cipher with A Single Permutation

22:49

Cryptography from One-Way Communication: On Completeness of Finite Channels

20:55

Possibility and Impossibility Results for Receiver Selective Opening Secure PKE in the Multi-Ch...

21:00

A New Decryption Failure Attack against HQC

24:04

MPC with Synchronous Security and Asynchronous Responsiveness

24:38

Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security

17:19

Improved Security Analysis for Nonce-based Enhanced Hash-then-Mask MACs

28:09

On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation

24:39

Side Channel Information Set Decoding using Iterative Chunking

20:28

Public-Key Generation with Verifiable Randomness

23:26

Fuzzy Asymmetric Password-Authenticated Key Exchange

22:33

Efficient Homomorphic Comparison Methods with Optimal Complexity

21:35

Non-Committing Encryption with Constant Ciphertext Expansion from Standard Assumptions

21:55

Improving Speed and Security in Updatable Encryption Schemes

24:40

SiGamal: A supersingular isogeny-based PKE and its application to a PRF

20:46

Privacy-Preserving Pattern Matching on Encrypted Data

24:30

Lattice-Based E-Cash, Revisited

25:39

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Stor...

23:11

The Direction of Updatable Encryption does not Matter Much

18:12

Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption

25:04

Determining the Core Primitive for Optimally Secure Ratcheting

22:53

Minimizing the Two-Round Tweakable Even-Mansour Cipher

20:29

Mind the Propagation of States New Automatic Search Tool for Impossible Differentials and Impo...

38:24

B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion

24:26

Estimating quantum speedups for lattice sieves

24:12

Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning

19:55

Towards Classical Hardness of Module-LWE: The Linear Rank Case

24:56

MOTIF: (Almost) Free Branching in GMW via Vector-Scalar Multiplication

24:59

Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings

1:29:46

s-22: Secret Sharing and Coding

1:19:06

s-#: TCC 2020 sessions Day 4

1:24:26

s-20: Quantum and Sampling

1:06:51

s-19: Workshop: Matches Made in Heaven

1:25:11

s-106: Workshop: Matches Made in Heaven

53:21

s-18: TCC Test of Time Award

1:17:11

s-16: Secure Computation II

1:18:46

s-14: Secure Computation I

1:23:06

s-13: Workshop: Matches Made in Heaven

1:23:36

s-105: Workshop: Matches Made in Heaven

1:12:26

s-12: Zero Knowledge

1:19:01

s-10: Succinct Arguments

1:11:36

s-7: Workshop: Matches Made in Heaven

1:16:36

s-6: Oblivious structures, Key-exchange and Group messaging

1:27:51

s-2: Blockchains