-
2
-
-
0842304790
-
Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme
-
Springer
-
A. Boldyreva. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme. In Proceedings of PKC'03, Lecture Notes in Computer Science. Springer, 2003.
-
(2003)
Proceedings of PKC'03, Lecture Notes in Computer Science
-
-
Boldyreva, A.1
-
6
-
-
84946840347
-
Short signatures from the Weil pairing
-
Springer
-
D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology Proceedings of Asiacrypt'01, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer, 2001.
-
(2001)
Advances in Cryptology Proceedings of Asiacrypt'01, Volume 2248 of Lecture Notes in Computer Science
, vol.2248
, pp. 514-532
-
-
Boneh, D.1
Lynn, B.2
Shacham, H.3
-
7
-
-
35248844436
-
An Identity-Based Signature from Gap Diffie-Hellman Groups
-
Lecture Notes in Computer Science. Springer
-
J. Cha and J. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups. In Proceedings of PKC'03, Lecture Notes in Computer Science. Springer, 2003.
-
(2003)
Proceedings of PKC'03
-
-
Cha, J.1
Cheon, J.2
-
9
-
-
35248845998
-
Simple Identity-Based Cryptography with Mediated RSA
-
Lecture Notes in Computer Science. Springer
-
X. Ding and G. Tsudik. Simple Identity-Based Cryptography with Mediated RSA. In Proceedings of CT-RSA '03, Lecture Notes in Computer Science. Springer, 2003.
-
(2003)
Proceedings of CT-RSA '03
-
-
Ding, X.1
Tsudik, G.2
-
12
-
-
84880853825
-
RSA-OAEP Is Secure under the RSA Assumption
-
Springer
-
E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP Is Secure under the RSA Assumption. In Advances in Cryptology - Proceedings of CRYPTO'01, volume 2139 of Lecture Notes in Computer Science, pages 260-274. Springer, 2001.
-
(2001)
Advances in Cryptology - Proceedings of CRYPTO'01, Volume 2139 of Lecture Notes in Computer Science
, vol.2139
, pp. 260-274
-
-
Fujisaki, E.1
Okamoto, T.2
Pointcheval, D.3
Stern, J.4
-
13
-
-
84947926543
-
Robust Threshold DSS Signatures
-
Springer
-
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust Threshold DSS Signatures. In Advances in Cryptology - Eurocrypt'96, volume 1070 of Lecture Notes in Computer Science, pages 354-371. Springer, 1996.
-
(1996)
Advances in Cryptology - Eurocrypt'96, Volume 1070 of Lecture Notes in Computer Science
, vol.1070
, pp. 354-371
-
-
Gennaro, R.1
Jarecki, S.2
Krawczyk, H.3
Rabin, T.4
-
14
-
-
0021409284
-
Probabilistic Encryption
-
S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS 28(2): 270-299 (1984).
-
(1984)
JCSS
, vol.28
, Issue.2
, pp. 270-299
-
-
Goldwasser, S.1
Micali, S.2
-
16
-
-
1642407903
-
Efficient identity based signature schemes based on pairings
-
Lecture Notes in Computer Science. Springer
-
F. Hess. Efficient identity based signature schemes based on pairings. In proceedings of SAC'02, Lecture Notes in Computer Science. Springer, 2002.
-
(2002)
Proceedings of SAC'02
-
-
Hess, F.1
-
21
-
-
0024983231
-
Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
-
ACM Press, New York
-
nd STOC, pages 427-437. ACM Press, New York, 1990.
-
(1990)
nd STOC
, pp. 427-437
-
-
Naor, M.1
Yung, M.2
-
23
-
-
0029769836
-
New el gamal type threshold digital signature scheme
-
C. Park and K. Kurosawa. New el gamal type threshold digital signature scheme. IEICE Trans., Vol.E79-A, No. 1 (1996) 86-93.
-
(1996)
IEICE Trans.
, vol.E79-A
, Issue.1
, pp. 86-93
-
-
Park, C.1
Kurosawa, K.2
-
24
-
-
0003614758
-
Digital Signatures and Public Key Functions as Intractable as Factoring
-
Lab. for Computer Science, MIT
-
M. Rabin. Digital Signatures and Public Key Functions as Intractable as Factoring. Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
-
(1979)
Technical Memo
, vol.TM-212
-
-
Rabin, M.1
-
28
-
-
0037142442
-
An identity based authenticated key agreement protocol based on the weil pairing
-
N. Smart. An identity based authenticated key agreement protocol based on the weil pairing. Electronic Letters, 38(13): 630-632, 2002.
-
(2002)
Electronic Letters
, vol.38
, Issue.13
, pp. 630-632
-
-
Smart, N.1
-
29
-
-
84958772823
-
Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold scheme for Implicit Certificates
-
Springer
-
D. Stinson and R. Strobl. Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold scheme for Implicit Certificates. In proc. of ACISP'01, volume 2119 of Lecture Notes in Computer Science, pages 417-434. Springer, 2001.
-
(2001)
Proc. of ACISP'01, Volume 2119 of Lecture Notes in Computer Science
, vol.2119
, pp. 417-434
-
-
Stinson, D.1
Strobl, R.2
|