28:06

Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions

32:43

Astrolabous: A Universally Composable Time Lock Encryption Scheme

19:12

Transciphering Framework for Approximate Homomorphic Encryption

13:00

Franchised Quantum Money

23:08

Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH

29:31

A Geometric Approach to Linear Cryptanalysis

31:41

On the hardness of the NTRU problem

19:59

How to Build a Trapdoor Function from an Encryption Scheme

24:16

Revisiting Homomorphic Encryption Schemes for Finite Fields

20:10

Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys

25:13

Redeeming Reset Indifferentiability and Applications to Post-Quantum Security

47:47

On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups

24:30

Digital Signatures with Memory-Tight Security in the Multi-Challenge Setting

15:24

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge

24:57

Lattice sieving via quantum random walks

23:57

Efficient Boolean Search over Encrypted Data with Reduced Leakage

34:16

Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable...

17:09

Balanced Non-Adjacent Forms

20:45

Faster Dual Lattice Attacks for Solving LWE -- with applications to CRYSTALS

10:39

Automatic Classical and Quantum Rebound Attacks on AES-like Hashing by Exploiting Related-key D...

14:44

Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation

20:49

Public Key Encryption with Flexible Pattern Matching

20:06

NTRU Fatigue: How Stretched is Overstretched?

29:29

Garbling, Stacked and Staggered: Faster k-out-of-n Garbled Function Evaluation

22:13

Onion Routing with Replies

26:19

The One-More Discrete Logarithm Assumption in the Generic Group Model

14:05

A formula for disaster: a unified approach to elliptic curve special-point-based attacks

31:43

Secure and Efficient Software Masking on Superscalar Pipelined Processors

22:14

Promise $\Sigma$-protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on...

23:31

Compressed Sigma-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmi...

21:25

Bit Security as Computational Cost for Winning Games with High Probability

14:58

Double-Block-Length Hash Function for Minimum Memory Size

18:49

A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV

50:37

Improved single-round secure multiplication using regenerating codes

30:48

Proofs for Inner Pairing Products and Applications

22:57

Algebraic Attacks on Rasta and Dasta Using Low-Degree Equations

24:04

Strong and Tight Security Guarantees against Integral Distinguishers

22:57

Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions...

21:38

Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy

14:21

Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions

20:37

A Practical Key-Recovery Attack on 805-Round Trivium

26:41

Gladius: LWR based efficient hybrid public key encryption with distributed decryption

24:18

Homomorphic Secret Sharing for Multipartite and General Adversary Structures Supporting Paralle...

25:06

Partial Key Exposure Attack on Short Secret Exponent CRT-RSA

24:55

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Exten...

28:37

On the non-tightness of measurement-based reductions for key encapsulation mechanism in the qua...

24:36

PrORAM: Fast O(log n) Authenticated Shares ZK ORAM

21:41

Convexity of division property transitions: theory, algorithms and compact models

48:21

session-22: Routing, Signatures, Commitments, Timelock

56:25

session-20: Zero Knowledge, OT, Key Management

59:05

session-113: Foundations II

57:28

session-14: PIR, Encrypted RAM, Commitments

55:56

session-12: Multi-party Computation II

53:31

session-111: Quantum II

43:51

session-9: Zero Knowledge and Proof Systems

1:09:45

session-7: Invited talk by Abhishek Jain

1:08:58

session-4: ABE, FE, Obfuscation and Non Traditional Models

1:05:57

session-109: Multi-party Computation I

11:48

The Exciting Conclusion of Tuesday's session on Zero Knowledge and Proof Systems

32:35

session-98: Quantum I

59:00

session-1: Welcome + Foundations I

29:54

Quantum Key-length Extension

27:30

Unclonable Encryption, Revisited

35:37

Disappearing Cryptography in the Bounded Storage Model

19:00

Classical Binding for Quantum Commitments

20:34

Adaptive Security of Multi-Party Protocols, Revisited

31:57

Trojan-Resilience without Cryptography

49:29

Multi-Party Functional Encryption

17:20

On Communication-Efficient Asynchronous MPC with Adaptive Security

22:25

On Communication Models and Best-Achievable Security in Two-Round MPC

19:24

Relationships between quantum IND-CPA notions

37:35

Covert Learning: How to Learn with an Untrusted Intermediary

22:07

Polynomial-time targeted attacks on coin-tossing for any number of corruptions

19:47

Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication

23:14

Blockchains Enable Non-Interactive MPC

24:30

On expected polynomial runtime in cryptography

22:53

Towards Tight Adaptive Security of Non-Interactive Key Exchange

29:21

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation

30:08

Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy

38:55

Updatable Public Key Encryption in the Standard Model

21:58

BKW Meets Fourier: New Algorithms for LPN with Sparse Parities

39:55

Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions

17:01

Vector and Functional Commitments from Lattices

15:33

Unifying Presampling via Concentration Bounds

30:22

On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger

22:42

Amortizing Rate-1 OT and Applications to PIR and PSI

19:14

Direct Product Hardness Amplification

25:19

Rate-1 Quantum Fully Homomorphic Encryption

30:31

The Round Complexity of Quantum Zero-Knowledge

36:19

Grafting Key Trees: Efficient Key Management for Overlapping Groups

26:20

Concurrent Composition of Differential Privacy

24:22

Non-Malleable Vector Commitments via Local Equivocability

31:57

Non-Malleable Time-Lock Puzzles and Applications

26:55

The Cost of Adaptivity in Security Games on Graphs

28:33

Efficient Perfectly Secure Computation with Optimal Resilience

35:21

Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (T...

37:02

Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitment...

31:39

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

18:19

Laconic Private Set Intersection and Applications

24:04

Secure Software Leasing Without Assumptions