UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists

Bayer, S; Groth, J; (2013) Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists. In: Advances in Cryptology – EUROCRYPT 2013: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. (pp. 646 - 663). Springer Verlag: Berlin/ Heidelberg, Germany. Green open access

[img]
Preview
PDF
PolynomialZK30.pdf

Download (315kB)

Abstract

Verification of a polynomial’s evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or membership proofs. We construct a novel special honest verifier zero-knowledge argument for correct polynomial evaluation. The argument has logarithmic communication cost in the degree of the polynomial, which is a significant improvement over the state of the art with cubic root complexity at best. The argument is relatively efficient to generate and very fast to verify compared to previous work. The argument has a simple public-coin 3-move structure and only relies on the discrete logarithm assumption. The polynomial evaluation argument can be used as a building block to construct zero-knowledge membership and non-membership arguments with communication that is logarithmic in the size of the blacklist. Non-membership proofs can be used to design anonymous blacklisting schemes allowing online services to block misbehaving users without learning the identity of the user. They also allow the blocking of single users of anonymization networks without blocking the whole network.

Type: Proceedings paper
Title: Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
Event: Advances in Cryptology - EUROCRYPT
ISBN: 978-3-642-38347-2
Open access status: An open access version is available from UCL Discovery
DOI: 10.1007/978-3-642-38348-9_38
Publisher version: http://dx.doi.org/10.1007/978-3-642-38348-9_38
Language: English
Additional information: © IACR 2013. This article is the final version submitted by the author(s) to the IACR and to Springer-Verlag. The version published by Springer-Verlag is available at 10.1007/978-3-642-38348-9_38
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/1398517
Downloads since deposit
161Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item