IEICE TRANSACTIONS on Fundamentals
Demonstrating Possession without Revealing Factors
Summary :
This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.1 pp.39-46
- Publication Date
- 1994/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroki SHIZUYA, Kenji KOYAMA, Toshiya ITOH, "Demonstrating Possession without Revealing Factors" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 1, pp. 39-46, January 1994, doi: .
Abstract: This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_1_39/_p
Copy
@ARTICLE{e77-a_1_39,
author={Hiroki SHIZUYA, Kenji KOYAMA, Toshiya ITOH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Demonstrating Possession without Revealing Factors},
year={1994},
volume={E77-A},
number={1},
pages={39-46},
abstract={This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Demonstrating Possession without Revealing Factors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 39
EP - 46
AU - Hiroki SHIZUYA
AU - Kenji KOYAMA
AU - Toshiya ITOH
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1994
AB - This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.
ER -
English
