-
1
-
-
37749025473
-
An identification scheme based on the elliptic curve discrete logarithm problem
-
High Performance Computing in the Asia-Pacific Region, 2000
-
C. Popescu, "An Identification Scheme Based on the Elliptic Curve Discrete Logarithm Problem," High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on, Vol. 2, 2000, pp. 624-625.
-
(2000)
Proceedings. The Fourth International Conference/Exhibition
, vol.2
, pp. 624-625
-
-
Popescu, C.1
-
2
-
-
0024611659
-
The knowledge complexity of interactive proofs
-
S. Goldwasser, S. Micali and C. Rackoff, "The Knowledge Complexity of Interactive Proofs," SIAM J. Comput., 18, 1, 1989, pp. 186-208.
-
(1989)
SIAM J. Comput.
, vol.18
, Issue.1
, pp. 186-208
-
-
Goldwasser, S.1
Micali, S.2
Rackoff, C.3
-
3
-
-
85034644807
-
Efficient zero-knowledge identification scheme for smart cards
-
LNCS 330, Springer-Verlag
-
T. Beth, "Efficient Zero-Knowledge Identification Scheme for Smart Cards," Proceedings of Eurocrypt'88, LNCS 330, Springer-Verlag, 1988, pp.77-86.
-
(1988)
Proceedings of Eurocrypt'88
, pp. 77-86
-
-
Beth, T.1
-
5
-
-
84990731886
-
How to prove yourself: Practical solutions to identification and signature problems
-
LNCS 263, Springer-Verlag
-
A. Fiat and A. Shamir, "How to Prove Yourself: Practical Solutions to Identification and Signature Problems," Proceedings of CRYPTO '86, LNCS 263, Springer-Verlag, 1987, pp. 186-194.
-
(1987)
Proceedings of CRYPTO '86
, pp. 186-194
-
-
Fiat, A.1
Shamir, A.2
-
6
-
-
85031804925
-
A modification of the fiat-shamir scheme
-
LNCS 403, Springer-Verlag
-
K. Ohta, and T. Okamoto, "A Modification of the Fiat-Shamir Scheme," Proceedings of Crypto '88, LNCS 403, Springer-Verlag, 1990, pp.232-243.
-
(1990)
Proceedings of Crypto '88
, pp. 232-243
-
-
Ohta, K.1
Okamoto, T.2
-
7
-
-
0038400155
-
Practical identification schemes as secure the DL and RSA problems
-
submitted to, March
-
T. Okamoto, "Practical Identification Schemes as Secure the DL and RSA Problems," submitted to IEEE P1363: Identification Schemes, March 1999. http://grouper.ieee.org/groups/1363/StudyGroup/Identification.html
-
(1999)
IEEE P1363: Identification Schemes
-
-
Okamoto, T.1
-
8
-
-
84874800178
-
A public key cryptosystem and a signature scheme based on discrete logarithms
-
T. ElGamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Trans. Inf. Theory IT-31 (4), 1985, pp. 469-472.
-
(1985)
IEEE Trans. Inf. Theory
, vol.IT-31
, Issue.4
, pp. 469-472
-
-
ElGamal, T.1
-
9
-
-
0028508211
-
Group-oriented (t, n) threshold digital signature scheme and digital multisignature
-
L. Harn, "Group-oriented (t, n) Threshold Digital Signature Scheme and Digital Multisignature," IEE Proc. Computers and Digital Techniques 141 (5), 1994,pp. 307-313.
-
(1994)
IEE Proc. Computers and Digital Techniques
, vol.141
, Issue.5
, pp. 307-313
-
-
Harn, L.1
-
10
-
-
0038061877
-
Knowledge-Proof based versatile smart card verification protocol
-
ACM SIGCOMM, July
-
D. Nyang and J. Song, "Knowledge-Proof Based Versatile Smart Card Verification Protocol," Computer Communication Review, ACM SIGCOMM, Vol. 30, July 2000.
-
(2000)
Computer Communication Review
, vol.30
-
-
Nyang, D.1
Song, J.2
-
12
-
-
84919085619
-
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance
-
S. Pohlig and M. Hellman, "An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance," IEEE Transactions on Information Theory, Vol. 24, 1978, pp. 106-110.
-
(1978)
IEEE Transactions on Information Theory
, vol.24
, pp. 106-110
-
-
Pohlig, S.1
Hellman, M.2
|