Efficient zero-knowledge arguments from two-tiered homomorphic commitments
From MaRDI portal
Publication:3102201
DOI10.1007/978-3-642-25385-0_23zbMATH Open1227.94047OpenAlexW41098585MaRDI QIDQ3102201FDOQ3102201
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
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
sublinear communicationcircuit satisfiabilityzero-knowledge argumentsrange proofstwo-tiered homomorphic commitments
Cited In (19)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- New Techniques for Non-interactive Shuffle and Range Arguments
- Lattice-based inner product argument
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Structure-preserving signatures and commitments to group elements
- Removing the Strong RSA Assumption from Arguments over the Integers
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Proofs for inner pairing products and applications
- 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
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- 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
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
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)
