Zero-knowledge argument for polynomial evaluation with application to blacklists

DOI10.1007/978-3-642-38348-9_38MaRDI QIDQ4924437zbMATH OpenOpenAlexFDO

Authors Stephanie Bayer, Jens Groth

Publication date 31 May 2013

Published in Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.737.7717

zbMATH Keywords

anonymous blacklistingdiscrete logarithmmembership and non-membership proofspolynomial evaluationzero-knowledge argument

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient batch zero-knowledge arguments for low degree polynomials
• Efficient lattice-based polynomial evaluation and batch ZK arguments
• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
• Constant-Size Commitments to Polynomials and Their Applications
• Verifiable private polynomial evaluation

Cited in

(17)

• Attribute-based versions of Schnorr and ElGamal
• Succinct Diophantine-satisfiability arguments
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• New Techniques for Non-interactive Shuffle and Range Arguments
• scientific article; zbMATH DE number 1418320 (Why is no real title available?)
• Scalable multi-party private set-intersection
• 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
• \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
• Ba\textit{loo}: algebraic lookup arguments
• Lattice-based zero-knowledge arguments for additive and multiplicative relations
• Efficient lattice-based polynomial evaluation and batch ZK arguments

This page was built for publication: Zero-knowledge argument for polynomial evaluation with application to blacklists

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