Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=3JM5JKWdgDA


Category:
Vlog
Duration: 1:02:36
482 views
8

Jonathan Bootle (IBM Research - Zurich)
https://simons.berkeley.edu/talks/linear-time-zero-knowledge-arguments-logarithmic-proof-size
Proofs, Consensus, and Decentralizing Society Reunion



Other Videos By Simons Institute for the Theory of Computing


2020-12-11iO via Functional Encryption: Techniques and Challenges from LWE
2020-12-11Panel Discussion: Computational Assumptions
2020-12-11On the Assumptions Used for Obfuscation
2020-12-11Indistinguishability Obfuscation from Well-Founded Assumptions
2020-12-11LPN Based IO Part 2
2020-12-10LPN Based IO Part 1
2020-12-10The Journey Towards Program Obfuscation
2020-12-10Inference on Random Factor Graphs
2020-12-10Algorand Smart Contract Architecture
2020-12-10Economic Security of Distributed Systems
2020-12-10Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size
2020-12-09Faster, Smaller, Weaker, Darker
2020-12-09Price of Active Security in Multiparty Computation
2020-12-08Game-Theoretically Secure Protocols Inspired by Blockchains
2020-12-08Lightning Network Economics: Cost-Minimal Channels and their Implications for Network Structure
2020-12-08Local Proofs Approaching the Witness Length
2020-12-08Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma c
2020-12-08Central Bank Digital Currency: When Price and Bank Stability Collide
2020-12-08Blockchain as Regulatory Technology: from Code is law to Law as Code
2020-12-07Subquadratic SNARGs in the Random Oracle Model
2020-12-05Panel Discussion


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Jonathan Bootle
Proofs Consensus and Decentralizing Society Reunion