Non Interactive Zero Knowledge Proofs for Composite Statements

Explore a comprehensive presentation on non-interactive zero-knowledge proofs for composite statements in this 21-minute conference talk from Crypto 2018. Delve into the intricacies of zero-knowledge proofs, Sigma protocols, and garbled circuits. Examine different techniques for handling composite statements, addressing issues like loss of assets, solvency, and privacy. Investigate SNARK construction, discrete logarithm proofs, and point addition relations. Learn about privacy-preserving credentials and RSA signatures. Gain valuable insights into the cutting-edge research presented by Shashank Agrawal, Chaya Ganesh, and Payman Mohassel in their paper on this advanced cryptographic topic.

Introduction
Zero Knowledge Proof
Sigma Protocols
Garbled Circuits
Different Techniques
Composite Statements
Loss of Assets
Solvent
Privacy
Prohibitions
Proof
Snark Construction
Snark on Committed Input
Discrete logarithm proof
Point addition relation
Double discrete logarithm
PrivacyPreserving Credentials
RSA Signature