Rate-1 BARGs via fully-local SSB hash families

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


Duration: 45:41
158 views
4

Lalita Devadas (MIT)
https://simons.berkeley.edu/talks/lalita-devadas-mit-2023-05-01
Minimal Complexity Assumptions for Cryptography

We define and construct a fully-local somewhere statistically binding (SSB) hash family, in which local openings are succinct and, crucially, can be verified against a succinct digest of the hash value. We use this hash family to boost the succinctness of any nontrivial non-interactive batch argument (BARG) scheme to the best possible, given the extractability property we need. This immediately gives us two applications: multi-hop aggregate signatures and incrementally verifiable computation.



Other Videos By Simons Institute for the Theory of Computing


2023-05-03Capturing One-Way Functions via NP-Hardness of Meta-Complexity
2023-05-03Derandomization: A Quick Tutorial
2023-05-03SNARGs Beyond Non-Signaling
2023-05-03Cryptographic Hardness of Correlated Sampling
2023-05-03Incompressiblity and Next-Block Pseudoentropy
2023-05-02Cryptography and Kolmogorov Complexity: A Quick Tutorial
2023-05-02Constant-Round Arguments from One-Way Functions
2023-05-02New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ...
2023-05-02Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
2023-05-02Non-interactive Universal Arguments
2023-05-02Rate-1 BARGs via fully-local SSB hash families
2023-05-02Correlation Intractability and SNARGs from Sub-exponential DDH
2023-05-01Tutorial on Proof Systems
2023-04-29Connections Between Multicalibration and Doubly Robust Estimation
2023-04-29On the Causal Foundations of Fair Machine Learning
2023-04-29Social Norm Bias: Residual Harms of Fairness-Aware Algorithms
2023-04-29Measuring Our Chances: Risk Prediction in this World and its Betters
2023-04-29Omnipredictors for Constrained Optimization
2023-04-28Who is Fairer: Humans vs. Machines?
2023-04-28Algorithmic Collective Action in Machine Learning
2023-04-28Sample Complexity Bounds for Realizable Multicalibration


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Lalita Devadas
Minimal Complexity Assumptions for Cryptography