Distilling Constraints in Zero-Knowledge Protocols

DOI10.1007/978-3-031-13185-1_21MaRDI QIDQ6487324zbMATH OpenFDO

Authors Elvira Albert, Marta Bellés-Muñoz, Miguel Isabel, Clara Rodríguez-Núñez, Albert Rubio

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-13185-1_21

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Cryptography (94A60)

Recommendations

• Practical sublinear proofs for R1CS from lattices
• Zero knowledge protocols from succinct constraint detection
• Aurora: transparent succinct arguments for R1CS
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Scalable zero knowledge via cycles of elliptic curves

Cites work

• Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions
• On the size of pairing-based non-interactive arguments
• Snarks for C: verifying program executions succinctly and in zero knowledge
• The knowledge complexity of interactive proof-systems

This page was built for publication: Distilling Constraints in Zero-Knowledge Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487324)