Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
From MaRDI portal
Publication:4924437
DOI10.1007/978-3-642-38348-9_38zbMath1300.94040OpenAlexW2147479777MaRDI QIDQ4924437
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.737.7717
polynomial evaluationdiscrete logarithmzero-knowledge argumentanonymous blacklistingmembership and non-membership proofs
Related Items (13)
Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Private polynomial commitments and applications to MPC ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Proofs for inner pairing products and applications ⋮ Lattice-based inner product argument ⋮ Lattice-Based Proof of a Shuffle ⋮ Succinct Diophantine-satisfiability arguments ⋮ Scalable Multi-party Private Set-Intersection ⋮ Non-Interactive Zero-Knowledge Proofs of Non-Membership ⋮ New Techniques for Non-interactive Shuffle and Range Arguments
This page was built for publication: Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
