5:04

Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection

5:16

FINAL: Faster FHE instantiated with NTRU and LWE

5:01

Key-schedule Security for the TLS 1.3 Standard

2:39

On Rejection Sampling in Lyubashevsky's Signature Scheme

5:19

Cryptographic Primitives with Hinting Property

2:11

Towards Tight Security Bounds for OMAC, XCBC and TMAC

5:01

Jammin' on the deck

4:44

Short-lived zero-knowledge proofs and signatures

4:22

Concurrently Composable Non-Interactive Secure Computation

6:09

Efficient Adaptively-Secure Byzantine Agreement for Long Messages

3:43

Group Action Key Encapsulation and Non-Interactive Key Exchange in the QROM

4:18

Memory-Tight Multi-Challenge Security of Public-Key Encryption

3:29

Rotatable Zero Knowledge Sets: Post Compromise Secure Auditable Dictionaries with application t...

7:33

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model

4:37

Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model

4:08

Classically Verifiable NIZK for QMA with Preprocessing

3:32

BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications

5:02

Statistical Decoding 2.0: Reducing Decoding to LPN

7:01

A Modular Approach to the Security Analysis of Two-Permutation Constructions

2:37

Latin Dances Reloaded: Improved Cryptanalysis against Salsa and ChaCha, and the proposal of For...

3:39

Identity-Based Matchmaking Encryption from Standard Assumptions

5:04

A Non-heuristic Approach to Time-space Tradeoffs and Optimizations for BKW

4:50

Compact and Tightly Selective-Opening Secure Public-key Encryption Schemes

4:25

Key-Reduced Variants of 3kf9 with Beyond-Birthday-Bound Security

3:38

Exploring SAT for Cryptanalysis: (Quantum) Collision Attacks against 6-Round SHA-3

4:58

Non-Interactive Secure Computation of Inner-Product from LPN and LWE

5:00

Random Sources in Private Computation

4:54

Mind the TWEAKEY Schedule: Cryptanalysis on SKINNYe-64-256

3:13

Threshold Linearly Homomorphic Encryption on Z/2^kZ

3:35

Improved Straight-Line Extraction in the Random Oracle Model With Applications to Signature Agg...

4:16

Large-Precision Homomorphic Sign Evaluation using FHEW/TFHE Bootstrapping

3:19

Efficient Searchable Symmetric Encryption for Join Queries

4:58

Unconditionally Secure NIZK in the Fine-Grained Setting

4:52

Towards Practical Topology-Hiding Computation

4:49

A Universally Composable Non-Interactive Aggregate Cash System

4:53

Horizontal racewalking using radical isogenies

5:27

Linear-map Vector Commitments and their Practical Applications

5:00

A Modular Approach to the Incompressibility of Block-Cipher-Based AEADs

4:12

On the Field-Based Division Property: Applications to MiMC, Feistel MiMC and GMiMC

4:24

Stretching Cube Attacks: Improved Methods to Recover Massive Superpolies

4:23

The Abe-Okamoto Partially Blind Signature Scheme Revisited

5:09

Encryption to the Future A Paradigm for Sending Secret Messages to Future (Anonymous) Committee...

5:22

Attaining GOD Beyond Honest Majority With Friends and Foes

3:48

Multi-User Security of the Sum of Truncated Random Permutations

4:08

A New Isogeny Representation and Applications to Cryptography

2:59

Revisiting Related-Key Boomerang attacks on AES using computer-aided tool

3:54

Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures

3:51

Universal Ring Signatures in the Standard Model

1:51

Towards Case-Optimized Hybrid Homomorphic Encryption -Featuring the Elisabeth Stream Cipher-

4:11

A Third is All You Need: Extended Partial Key Exposure Attack on CRT-RSA with Additive Exponent...

3:13

Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Subli...

4:50

DAG-$\Sigma$: A DAG-based Sigma Protocol for Relations in CNF

4:36

Anonymous Public Key Encryption under Corruptions

5:01

Privacy-Preserving Authenticated Key Exchange in the Standard Model

4:02

Functional Encryption with Secure Key Leasing

4:14

Optimising Linear Key Recovery Attacks with Affine Walsh Transform Pruning

5:01

General Properties of Quantum Bit Commitments (Extended Abstract)

4:51

Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers

5:00

SIDH Proof of Knowledge

5:57

EvalRound Algorithm in CKKS Bootstrapping

4:21

GUC-Secure Commitments via Random Oracles: New Impossibility and Feasibility

4:25

Efficient NIZKs from LWE via Polynomial Reconstruction and ``MPC in the Head''

4:12

Optimizing Rectangle Attacks: A Unified and Generic Framework for Key Recovery

4:09

New Algorithms and Analyses for Sum-Preserving Encryption

4:34

Compact FE for Unbounded Attribute-Weighted Sums for Logspace from SXDH

4:44

State Machine Replication under Changing Network Conditions

3:40

Practical Provably Secure Flooding for Blockchains

4:29

Authenticated Encryption with Key Identification

4:05

Recovering the tight security proof of SPHINCS+

4:55

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK

3:56

Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple

4:41

Full Quantum Equivalence of Group Action DLog and CDH, and More

4:53

SNACKs: Leveraging Proofs of Sequential Work for Blockchain Light Clients

4:50

Nostradamus goes Quantum

5:01

Failing gracefully: Decryption failures and the Fujisaki-Okamoto transform

4:56

Continuously Non-Malleable Codes against Bounded-Depth Tampering

5:09

Enhancing Differential-Neural Cryptanalysis

5:02

Knowledge Encryption and Its Applications to Simulatable Protocols With Low Round-Complexity

4:52

Multi-Client Functional Encryption with Fine-Grained Access Control

4:52

Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits

5:15

Algebraic Meet-in-the-Middle Attack on LowMC

2:39

On Module Unique-SVP and NTRU

3:50

Improving Bounds on Elliptic Curve Hidden Number Problem for ECDH Key Exchange

4:54

Mind the TWEAKEY Schedule: Cryptanalysis on SKINNYe-64-256

5:06

Puncturable Key Wrapping and Its Applications

5:28

Security of Truncated Permutation Without Initial Value

4:41

SwiftEC: Shallue--van de Woestijne Indifferentiable Function to Elliptic Curves

2:53

Flashproofs: Efficient Zero-Knowledge Arguments of Range and Polynomial Evaluation with Transpa...

56:44

TCC 2022 session on OT, PIR, and Secret Sharing

1:05:19

TCC 2022 session on Theory II and Closing Remarks

1:00:31

TCC 2022 session on Lattices

1:04:09

TCC 2022 session on Anonymity Verifiability and Robustness

1:03:24

TCC 2022 session on Protocols Key Agreement and Commitments

53:19

TCC 2022 session on Theory I Sampling and Friends

1:02:51

TCC 2022 Invited talk by Eran Tromer

1:02:06

TCC 2022 session on multi party computation I

55:17

TCC 2022 session on multi party computation II

46:18

TCC 2022 session on IBE and FE

1:06:07

TCC 2022 test of time award session

45:21

TCC 2022 session on encryption galore