1:07:36

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

IACR

9:06

s-1: Opening Remarks for TCC 2020

IACR

29:59

Lossiness and Entropic Hardness for Ring-LWE

IACR

17:29

Multi-key Fully-Homomorphic Encryption in the Plain Model

IACR

17:26

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions

IACR

23:40

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

IACR

25:15

Optimal Broadcast Encryption from LWE and Pairings in the Standard Model

IACR

20:44

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

IACR

1:18:01

s-4: LWE and Encryption

IACR

24:41

Can a Blockchain Keep a Secret?

IACR

22:12

Expected Constant Round Byzantine Broadcast under Dishonest Majority

IACR

15:37

Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions

IACR

23:11

Blockchains from Non-Idealized Hash Functions

IACR

29:34

Ledger Combiners for Fast Settlement

IACR

20:22

Asynchronous Byzantine Agreement with Subquadratic Communication

IACR

19:19

On the Security of Time-Lock Puzzles and Timed Commitments

IACR

1:27:51

s-2: Blockchains

IACR

24:21

A Lower Bound for One-Round Oblivious RAM

IACR

26:31

Lower Bounds for Multi-Server Oblivious RAMs

IACR

22:51

On Computational Shortcuts for Information-Theoretic PIR

IACR

28:13

On the Price of Concurrency in Group Ratcheting Protocols

IACR

18:03

Stronger Security and Constructions of Multi-Designated Verifier Signatures

IACR

28:57

Continuous Group Key Agreement with Active Security

IACR

26:43

Security analysis of SPAKE2+

IACR

1:16:36

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

IACR

1:11:36

s-7: Workshop: Matches Made in Heaven

IACR

26:31

Proof-Carrying Data from Accumulation Schemes

IACR

19:48

Linear-Time Arguments with Sublinear Verification from Tensor Codes

IACR

25:34

Barriers for Succinct Arguments in the Random Oracle Model

IACR

23:56

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

IACR

21:41

Batch Verification for Statistical Zero Knowledge Proofs

IACR

25:47

Batch Verification and Proofs of Proximity with Polylog Overhead

IACR

25:03

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

IACR

1:19:01

s-10: Succinct Arguments

IACR

20:10

Characterizing Deterministic-Prover Zero Knowledge

IACR

25:09

NIZK from SNARG

IACR

15:07

Weakly Extractable One-Way Functions

IACR

21:14

Towards Non-Interactive Witness Hiding

IACR

23:19

Perfect Zero Knowledge: New Upperbounds and Relativized Separations

IACR

23:52

FHE-Based Bootstrapping of Designated-Prover NIZK

IACR

19:41

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

IACR

1:12:26

s-12: Zero Knowledge

IACR

1:23:36

s-105: Workshop: Matches Made in Heaven

IACR

1:23:06

s-13: Workshop: Matches Made in Heaven

IACR

22:10

Round Optimal Secure Multiparty Computation from Minimal Assumptions

IACR

24:28

Reusable Two-Round MPC from DDH

IACR

24:28

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation

IACR

23:20

Secure Massively Parallel Computation for Dishonest Majority

IACR

19:17

On Statistical Security in Two-Party Computation

IACR

26:11

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

IACR

21:35

Synchronous Constructive Cryptography

IACR

1:18:46

s-14: Secure Computation I

IACR

28:10

Topology-Hiding Communication from Minimal Assumptions.

IACR

20:26

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

IACR

24:02

Towards Multiparty Computation Withstanding Coercion of All Parties

IACR

26:42

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

IACR

25:48

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

IACR

25:33

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

IACR

24:37

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

IACR

1:17:11

s-16: Secure Computation II

IACR

53:21

s-18: TCC Test of Time Award

IACR

1:25:11

s-106: Workshop: Matches Made in Heaven

IACR

1:06:51

s-19: Workshop: Matches Made in Heaven

IACR

22:49

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

IACR

22:12

Quantum encryption with certified deletion

IACR

27:06

Secure Quantum Extraction Protocols

IACR

21:21

Non-interactive classical verification of quantum computation

IACR

21:14

Classical Verification of Quantum Computations with Efficient Verifier

IACR

25:33

On Perfect Correctness in (Lockable) Obfuscation

IACR

25:46

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

IACR

17:30

On Pseudorandom Encodings

IACR

1:24:26

s-20: Quantum and Sampling

IACR

20:42

Coupling of Random Systems

IACR

18:40

Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity

IACR

20:30

Zero-Communication Reductions

IACR

29:27

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions

IACR

21:30

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

IACR

27:44

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

IACR

18:16

On the Complexity of Arithmetic Secret Sharing

IACR

18:50

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

IACR

23:23

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

IACR

23:49

Transparent Error Correcting in a Computationally Bounded World

IACR

17:31

New Techniques in Replica Encodings with Client Setup

IACR

23:16

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

IACR

23:09

On the Round Complexity of the Shuffle Model

IACR

1:29:46

s-22: Secret Sharing and Coding

IACR