Statistical ZAP Arguments

Explore a groundbreaking paper on Statistical ZAP Arguments presented at Eurocrypt 2020. Delve into the intricacies of argument systems, focusing on the novel concept of statistical zap arguments. Examine the first result and its implications, followed by an in-depth analysis of the Fiat-Shamir transform and its soundness. Investigate correlation intractability for efficient functions and commitment schemes, with particular emphasis on computational aspects and scheme properties. Uncover the challenges and potential solutions in statistically-hiding extractable commitments, and study the proposed construction. Conclude with a comprehensive recap of this cutting-edge research in cryptography.

Intro
Argument Systems
Statistical Zap Arguments
First Result
Outline
The Fiat-Shamir Transform
Can We Prove Soundness
Correlation Intractability for Efficient Functions
Commitment Schemes
First Step: Computational
Commitment Scheme Properties
Are we stuck?
Statistically-Hiding Extractable Commitments?
The Construction
Recap