11:06

s-1: Opening remarks for Asiacrypt 2020

IACR

1:03:01

s-2: Invited Talk by Shweta Agrawal

IACR

1:33:31

s-3: Best paper award (Asiacrypt 2020)

IACR

20:28

Public-Key Generation with Verifiable Randomness

IACR

24:38

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

IACR

18:54

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

IACR

20:55

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

IACR

27:39

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

IACR

21:53

Circular Security Is Complete for KDM Security

IACR

54:46

s-120: Encryption Schemes

IACR

23:13

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

IACR

26:11

Post-Quantum Verification of Fujisaki-Okamoto

IACR

21:00

A New Decryption Failure Attack against HQC

IACR

30:36

s-121: Post-quantum Cryptography

IACR

23:12

On the Adaptive Security of MACs and PRFs

IACR

17:19

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

IACR

30:01

How to Build Optimally Secure PRFs Using Block Ciphers

IACR

30:06

s-7: Message Authentication Codes

IACR

54:16

s-8: Invited Talk by Jung Hee Cheon

IACR

22:16

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

IACR

20:29

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

IACR

17:44

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

IACR

20:16

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

IACR

23:42

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

IACR

22:49

Lower Bounds on the Degree of Block Ciphers

IACR

31:38

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

IACR

1:11:51

s-10: Cryptanalysis

IACR

22:53

Minimizing the Two-Round Tweakable Even-Mansour Cipher

IACR

18:12

Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption

IACR

19:09

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

IACR

30:11

s-12: Symmetric Key Cryptography

IACR

20:04

SILVER - Statistical Independence and Leakage Verification

IACR

24:41

Cryptanalysis of Masked Ciphers: A not so Random Idea

IACR

20:41

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

IACR

24:39

Side Channel Information Set Decoding using Iterative Chunking

IACR

40:51

s-11: Side-Channel Analysis

IACR

56:32

s-124: Rump session (Asiacrypt 2020)

IACR

20:46

Privacy-Preserving Pattern Matching on Encrypted Data

IACR

21:35

Non-Committing Encryption with Constant Ciphertext Expansion from Standard Assumptions

IACR

21:17

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

IACR

22:33

Efficient Homomorphic Comparison Methods with Optimal Complexity

IACR

42:11

s-13: Public Key Cryptography I

IACR

25:39

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

IACR

26:29

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

IACR

24:06

Unbounded HIBE with Tight Security

IACR

20:09

Multi-Client Oblivious RAM with Poly-Logarithmic Communication

IACR

38:51

s-136: Public Key Cryptography II

IACR

24:59

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

IACR

19:55

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

IACR

24:30

Lattice-Based E-Cash, Revisited

IACR

26:05

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

IACR

20:36

Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers

IACR

53:11

s-16: Lattice-Based Cryptography

IACR

24:26

Estimating quantum speedups for lattice sieves

IACR

15:28

A Combinatorial Approach to Quantum Random Functions

IACR

17:44

Improved Classical and Quantum Algorithms for Subset-Sum

IACR

28:13

Security Limitations of Classical-Client Delegated Quantum Computing

IACR

25:30

Quantum Circuit Implementations of AES with Fewer Qubits

IACR

11:18

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

IACR

1:00:46

s-17: Quantum Algorithms

IACR

24:56

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

IACR

24:12

Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning

IACR

22:03

Secure MPC: Laziness Leads to GOD

IACR

19:58

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

IACR

28:09

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

IACR

51:56

s-118: Multi-party Computation I

IACR

23:19

Cryptographic Group Actions and Applications

IACR

38:24

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

IACR

24:55

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

IACR

22:30

Radical Isogenies

IACR

22:07

Oblivious Pseudorandom Functions from Isogenies

IACR

24:40

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

IACR

1:01:21

s-19: Isogeny-based Cryptography

IACR

23:26

Fuzzy Asymmetric Password-Authenticated Key Exchange

IACR

20:45

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

IACR

22:56

s-21: Authenticated Key Exchange

IACR

24:44

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing

IACR

21:14

Secret-Shared Shuffle

IACR

17:11

s-22: Secret Sharing

IACR

28:09

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

IACR

24:04

MPC with Synchronous Security and Asynchronous Responsiveness

IACR

24:34

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

IACR

25:30

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

IACR

26:52

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs

IACR

50:51

s-23: Multi-party Computation II

IACR

23:29

KVaC: Key-Value Commitments for Blockchains and Beyond

IACR

20:49

Catalic: Delegated PSI Cardinality with Applications to Contact Tracing

IACR

21:21

s-131: Blockchains and Contact Tracing

IACR

23:11

The Direction of Updatable Encryption does not Matter Much

IACR

21:55

Improving Speed and Security in Updatable Encryption Schemes

IACR

25:24

CCA Updatable Encryption Against Malicious Re-Encryption Attacks

IACR

25:04

Determining the Core Primitive for Optimally Secure Ratcheting

IACR

39:10

s-138: Updatable Encryption

IACR

22:49

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

IACR

21:09

Succinct Functional Commitment for a Large Class of Arithmetic Circuits

IACR

26:19

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

IACR

13:38

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

IACR

20:56

Succinct Diophantine-Satisfiability Arguments

IACR

25:27

Individual Simulations

IACR

58:51

s-27: Zero Knowledge

IACR