Efficient zero-knowledge arguments from two-tiered homomorphic commitments

DOI10.1007/978-3-642-25385-0_23MaRDI QIDQ3102201zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 2 December 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25385-0_23

zbMATH Keywords

sublinear communicationcircuit satisfiabilityzero-knowledge argumentsrange proofstwo-tiered homomorphic commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient batch zero-knowledge arguments for low degree polynomials
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• scientific article; zbMATH DE number 1559559
• scientific article; zbMATH DE number 1302863

Cited in

(21)

• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
• Lattice-based succinct arguments for NP with polylogarithmic-time verification
• New Techniques for Non-interactive Shuffle and Range Arguments
• Lattice-based inner product argument
• Structure-preserving signatures and commitments to group elements
• Zero-knowledge range arguments for signed fractional numbers from lattices
• Proofs for inner pairing products and applications
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• Practical sublinear proofs for R1CS from lattices
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• Linearly homomorphic structure-preserving signatures and their applications
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Computational integrity with a public random string from quasi-linear PCPs
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Removing the strong RSA assumption from arguments over the integers
• Vector commitments with proofs of smallness: short range proofs and more
• Cryptographic algorithms for privacy-preserving online applications
• Efficient range proofs with transparent setup from bounded integer commitments
• Efficient batch zero-knowledge arguments for low degree polynomials
• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments

This page was built for publication: Efficient zero-knowledge arguments from two-tiered homomorphic commitments

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