Simple Zero-Knowledge Proof of Knowing $\sqrt{X_1}$ or $\sqrt{X_2}$ mod $N$
Zhong, Sheng
Bull. Belg. Math. Soc. Simon Stevin, Tome 16 (2009) no. 1, p. 167-170 / Harvested from Project Euclid
Tompa and Woll constructed a zero-knowledge proof of knowing a square root of $X$ mod $N$, where $N$ is the product of two large, secret primes. In this paper, we construct a zero-knowledge proof of knowing a square root of $X_1$ or $X_2$ mod $N$. Compared with the existing solution to this problem, ours is significantly simpler.
Publié le : 2009-02-15
Classification:  Cryptography,  interactive proof,  zero-knowledge proof,  11T71,  94A60
@article{1235574200,
     author = {Zhong, Sheng},
     title = {Simple Zero-Knowledge Proof of Knowing $\sqrt{X\_1}$ or $\sqrt{X\_2}$ mod $N$},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {16},
     number = {1},
     year = {2009},
     pages = { 167-170},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1235574200}
}
Zhong, Sheng. Simple Zero-Knowledge Proof of Knowing $\sqrt{X_1}$ or $\sqrt{X_2}$ mod $N$. Bull. Belg. Math. Soc. Simon Stevin, Tome 16 (2009) no. 1, pp.  167-170. http://gdmltest.u-ga.fr/item/1235574200/