Advanced SearchSearch Tips
Generalization of Zero-Knowledge Proof of Polynomial Equality
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Generalization of Zero-Knowledge Proof of Polynomial Equality
Kim, Myungsun; Kang, Bolam;
  PDF(new window)
In this paper, we are interested in a generalization of zero-knowledge interactive protocols between prover and verifier, especially to show that the product of an encrypted polynomial and a random polynomial, but published by a secure commitment scheme was correctly computed by the prover. To this end, we provide a generalized protocol for proving that the resulting polynomial is correctly computed by an encrypted polynomial and another committed polynomial. Further we show that the protocol is also secure in the random oracle model. We expect that our generalized protocol can play a role of building blocks in implementing secure multi-party computation including private set operations.
Zero-knowledge proofs;Set operations;Polynomials;
 Cited by
R. Cramer, M. Franklin, B. Scheonmakers, and M. Yung, "Multi-authority secret-ballot elections with linear work," Advances in Cryptology-Eurocrypt LNCS, vol. 1070, pp. 72-83, 1996.

T. ElGamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," Advances in Cryptology-Crypto LNCS, pp. 10-18, 1985.

S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. Comput., vol. 18, no. 1, pp. 186-208, 1989. crossref(new window)

O. Goldreich, S. Micali, and A. Wigderson, "Proofs that yield nothing but their vality," J. ACM, vol. 38, no. 3, pp. 690-728, 1991. crossref(new window)

O. Goldreich, Foundations of cryptography vol. 1, Cambridge Press, 2004.

L. Kissner and D. Song, "Privacy-preserving set operation," Advances in cryptology-Crypto LNCS, vol. 3621, pp. 241-157, 2005.

P. Paillier, "Public-key crytpsystems based on composite degree residuosity classes," Advances in cryptology-Eurocrypt LNCS, vol. 1592, pp. 223-238, Apr. 1999.