Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
From MaRDI portal
Publication:3102201
DOI10.1007/978-3-642-25385-0_23zbMath1227.94047OpenAlexW41098585MaRDI QIDQ3102201
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
sublinear communicationcircuit satisfiabilityzero-knowledge argumentsrange proofstwo-tiered homomorphic commitments
Related Items (16)
Structure-preserving signatures and commitments to group elements ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Proofs for inner pairing products and applications ⋮ Lattice-based inner product argument ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ New Techniques for Non-interactive Shuffle and Range Arguments ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
