Generalization of Zero-Knowledge Proof of Polynomial Equality 


Vol. 40,  No. 5, pp. 833-840, May  2015


PDF
  Abstract

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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Kim and B. Kang, "Generalization of Zero-Knowledge Proof of Polynomial Equality," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 5, pp. 833-840, 2015. DOI: .

[ACM Style]

Myungsun Kim and Bolam Kang. 2015. Generalization of Zero-Knowledge Proof of Polynomial Equality. The Journal of Korean Institute of Communications and Information Sciences, 40, 5, (2015), 833-840. DOI: .

[KICS Style]

Myungsun Kim and Bolam Kang, "Generalization of Zero-Knowledge Proof of Polynomial Equality," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 5, pp. 833-840, 5. 2015.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880