Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1994-01-25
著者
-
Itoh Toshiya
Interdisciplinary Graduate School Of Science And Engineering Tokyo Institute Of Technology
-
Shizuya Hiroki
Education Center For Information Processing Tohoku University
-
KOYAMA Kenji
NTT Communication Science Laboratories
-
Shizuya Hiroki
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
-
Koyama Kenji
Ntt Communication Science Laboratory
-
Itoh Toshiya
Interdisciplinary Graduate School of Science and Engineering, Tokyo Institute of Technology
関連論文
- Checkers for Adaptive Programs
- The Security of an RDES Cryptosystem against Linear Cryptanalysis (Special Section on Cryptography and Information Security)
- Alternative Necessary and Sufficient Conditions for Collision Intractable Hashing
- Special Section on Cryptography and Information Security
- A Note on AM Languages Outside NP ⋃ co-NP (Special Section on Cryptography and Information Security)
- A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Seheme (Special Section on Cryptography and Information Security)
- Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
- On the Complexity of the Discrete Logarithm for a General Finite Group (Special Section on Cryptography and Information Security)
- On the Σ^b_1-Definability of Integer Factoring
- Two Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications(Special Section on Cryptography and Information Security)
- Efficient Cryptosystems over Elliptic Curves Based on a Product of Form-Free Primes (Special Section on Information Theory and Its Applications)
- A New RSA-Type Scheme Based on Singular Cubic Curves y^2≡x^3+bx^2 (mod n)
- Dynamic Swapping Schemes and Differential Cryptanalysis (Special Section on Information Theory and Its Applications)
- A New Version of FEAL, Stronger against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
- On the Power of Self-Testers and Self-Correctors (Special Section on Cryptography and Information Security)
- A New RSA-Type Scheme Based on Singular Cubic Curves (y-αx)(y-βx )≡x^3 (mod n) (Special Section on Cryptography and Information Security)
- Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation (Special Section on Cryptography and Information Security)
- A Signed Binary Window Method for Fast Computing over Elliptic Curves (Special Section on Cryptography and Information Security)
- On the Knowledge Tightness of Zero-Knowledge Proofs (Special Section on Cryptography and Information Security)
- Efficient Private Information Retrieval (Special Section on Cryptography and Information Security)
- On the Oracle Entropy and the Average Case Oracle Measure of Knowledge Complexity (Special Section on Cryptography and Information Security)
- Elliptic Curve Cryptosystems and Their Applications
- On the Solutions of the Diophantine Equation x^3+y^3+z^3=n
- How to Strengthen DES-like Cryptosystems against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- On the Knowledge Complexity of Arthur-Merlin Games (Special Section on Cryptography and Information Security)
- Improved Elliptic Curve Methods for Factoring and Their Performance (Special Section on Cryptography and Information Security)