TCC 2020

86 talks · 2020 · indexed by Breach Arc Archive. Links open each talk on YouTube.

Browse with filters →

A Lower Bound for One-Round Oblivious RAM 2020
A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity 2020
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interactio... 2020
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions 2020
Asynchronous Byzantine Agreement with Subquadratic Communication 2020
Barriers for Succinct Arguments in the Random Oracle Model 2020
Batch Verification and Proofs of Proximity with Polylog Overhead 2020
Batch Verification for Statistical Zero Knowledge Proofs 2020
Blockchains from Non-Idealized Hash Functions 2020
Can a Blockchain Keep a Secret? 2020
Characterizing Deterministic-Prover Zero Knowledge 2020
Classical Verification of Quantum Computations with Efficient Verifier 2020
Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions 2020
Continuous Group Key Agreement with Active Security 2020
Coupling of Random Systems 2020
CP-ABE for Circuits (and more) in the Symmetric Key Setting 2020
Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark) 2020
Expected Constant Round Byzantine Broadcast under Dishonest Majority 2020
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness 2020
FHE-Based Bootstrapping of Designated-Prover NIZK 2020
Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More 2020
Ledger Combiners for Fast Settlement 2020
Linear-Time Arguments with Sublinear Verification from Tensor Codes 2020
Lossiness and Entropic Hardness for Ring-LWE 2020
Lower Bounds for Multi-Server Oblivious RAMs 2020
Lower Bounds on the Time/Memory Tradeoff of Function Inversion 2020
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation 2020
Multi-key Fully-Homomorphic Encryption in the Plain Model 2020
New Techniques in Replica Encodings with Client Setup 2020
NIZK from SNARG 2020
Non-interactive classical verification of quantum computation 2020
Non-Malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition o... 2020
On Average-Case Hardness in TFNP from One-Way Functions 2020
On Computational Shortcuts for Information-Theoretic PIR 2020
On Perfect Correctness in (Lockable) Obfuscation 2020
On Pseudorandom Encodings 2020
On Statistical Security in Two-Party Computation 2020
On the Complexity of Arithmetic Secret Sharing 2020
On the Power of an Honest Majority in Three-Party Computation Without Broadcast 2020
On the Price of Concurrency in Group Ratcheting Protocols 2020
On the Round Complexity of the Shuffle Model 2020
On the Security of Time-Lock Puzzles and Timed Commitments 2020
Optimal Broadcast Encryption from LWE and Pairings in the Standard Model 2020
Perfect Zero Knowledge: New Upperbounds and Relativized Separations 2020
Proof-Carrying Data from Accumulation Schemes 2020
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads 2020
Quantum encryption with certified deletion 2020
Reusable Two-Round MPC from DDH 2020
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures 2020
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries 2020
Round Optimal Secure Multiparty Computation from Minimal Assumptions 2020
Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions 2020
s-102: Workshop: Matches made in heaven: Cryptography and Theoretical Computer Science 2020
s-105: Workshop: Matches Made in Heaven 2020
s-106: Workshop: Matches Made in Heaven 2020
s-10: Succinct Arguments 2020
s-12: Zero Knowledge 2020
s-13: Workshop: Matches Made in Heaven 2020
s-14: Secure Computation I 2020
s-16: Secure Computation II 2020
s-18: TCC Test of Time Award 2020
s-19: Workshop: Matches Made in Heaven 2020
s-1: Opening Remarks for TCC 2020 2020
s-20: Quantum and Sampling 2020
s-22: Secret Sharing and Coding 2020
s-2: Blockchains 2020
s-4: LWE and Encryption 2020
s-6: Oblivious structures, Key-exchange and Group messaging 2020
s-7: Workshop: Matches Made in Heaven 2020
Schr{\"o}dinger's Pirate: How To Trace a Quantum Decoder 2020
Secure Massively Parallel Computation for Dishonest Majority 2020
Secure Quantum Extraction Protocols 2020
Security analysis of SPAKE2+ 2020
Stronger Security and Constructions of Multi-Designated Verifier Signatures 2020
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption 2020
Synchronous Constructive Cryptography 2020
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors 2020
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs 2020
Topology-Hiding Communication from Minimal Assumptions. 2020
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity 2020
Towards Multiparty Computation Withstanding Coercion of All Parties 2020
Towards Non-Interactive Witness Hiding 2020
Transparent Error Correcting in a Computationally Bounded World 2020
Universal Composition with Global Subroutines: Capturing Global Setup within plain UC 2020
Weakly Extractable One-Way Functions 2020
Zero-Communication Reductions 2020