Sigma Protocols
summary
Proposal targets standardizing Sigma protocols for prime-order groups and non‑interactive proofs via Fiat‑Shamir, prescribing concrete hashes and encodings: include statement, generators, curve ID and a domain separator; three challenge options (modulo reduction, ITF high‑bit sampling, or sponge/STROBE), and nonce choices (true randomness vs deterministic RFC6979 style, noting determinism breaks OR/ring proofs). Outputs allow short vs batchable transcripts. Targets: P‑256/NIST‑style, Ristretto/Decaf, and optional pairing groups; guideline compares Sigma size/CPU to SNARKs/Bulletproofs and notes R1CS and threshold interoperability.
AI-written summary · about
chapters (5)
- 0:00Start
- 5:56Non-Interactivity
- 8:21Linear Relations
- 48:39R1cs Compatibility
- 49:48Shareproof Computation
related talks
36mUpdate on the NIST standardization of additional signature schemes
26mzk-SHARKs: Combining Succinct Verification and Public Coin Setup
28mRecent Developments on Multi-Party Schnorr Signatures
28mQuantum Proofing Sigstore: A Tale of Three Approaches
38mPrivacy Enhancing Cryptography at NIST
01h 32mSIG Auth Update and Deep Dive
46mAchieving Quantum Readiness: A Comprehensive Approach
44mStandardizing Zero Knowledge Proofs - Keynote