@inproceedings{f20e2b1bdcc1445e9abdbb0f939d7af1,
title = "Demonstrating possession without revealing factors and its application",
abstract = "This paper presents a zero-knowledge interactive protocol that demonstrates that two factors, a and b, of a composite number n (= ab) are actually known by the prover, without revelation of the factors themselves and where a and b are not necessarily primes. The security of this protocol is based on the difficulty of computing a discrete logarithm modulo a large prime. As an extension of this, a protocol that can demonstrate that two or more factors are known by the prover is shown and applied to a weighted membership protocol with hierarchical classes within a group.",
author = "Hiroki Shizuya and Kenji Koyama and Toshiya Itoh",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; 1st International Conference on Cryptology, AUSCRYPT 1990 ; Conference date: 08-01-1990 Through 11-01-1990",
year = "1990",
doi = "10.1007/BFb0030368",
language = "English",
isbn = "9783540530008",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "273--293",
editor = "Jennifer Seberry and Josef Pieprzyk",
booktitle = "Advances in Cryptology — AUSCRYPT 1990, International Conference on Cryptology, Proceedings",
address = "Germany",
}