-
1
-
-
84957360970
-
Collision-free accumulators and fail-stop signature schemes without trees
-
[BP97] Walter Fumy, editor, EUROCRYPT, Berlin, Springer-Verlag
-
[BP97] N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Walter Fumy, editor, EUROCRYPT, volume 1233 of Lecture Notes in Computer Science, pages 366-377, Berlin, 1997. Springer-Verlag.
-
(1997)
Lecture Notes in Computer Science
, vol.1233
, pp. 366-377
-
-
Barić, N.1
Pfitzmann, B.2
-
3
-
-
0031619016
-
The random oracle methodology, revisited (preliminary version)
-
[CGH98] New York, NY, USA, ACM Press
-
[CGH98] R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited (preliminary version). In Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pages 209-218, New York, NY, USA, 1998. ACM Press.
-
(1998)
Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC '98)
, pp. 209-218
-
-
Canetti, R.1
Goldreich, O.2
Halevi, S.3
-
4
-
-
35048875340
-
On the random-oracle methodology as applied to length-restricted signature schemes
-
[CGH04] Moni Naor, editor, TCC, Springer
-
[CGH04] R. Canetti, O. Goldreich, and S. Halevi. On the random-oracle methodology as applied to length-restricted signature schemes. In Moni Naor, editor, TCC, volume 2951 of Lecture Notes in Computer Science, pages 40-57. Springer, 2004.
-
(2004)
Lecture Notes in Computer Science
, vol.2951
, pp. 40-57
-
-
Canetti, R.1
Goldreich, O.2
Halevi, S.3
-
5
-
-
35248839965
-
A signature scheme with efficient protocols
-
[CL02] Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, SCN, Springer
-
[CL02] J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, SCN, volume 2576 of Lecture Notes in Computer Science, pages 268-289. Springer, 2002.
-
(2002)
Lecture Notes in Computer Science
, vol.2576
, pp. 268-289
-
-
Camenisch, J.1
Lysyanskaya, A.2
-
6
-
-
84948953220
-
Security analysis of the Gennaro-Halevi-Rabin signature scheme
-
[CN00] Bart Preneel, editor, EUROCRYPT, Springer
-
[CN00] J.-S. Coron and D. Naccache. Security analysis of the Gennaro-Halevi-Rabin signature scheme. In Bart Preneel, editor, EUROCRYPT, volume 1807 of Lecture Notes in Computer Science, pages 91-101. Springer, 2000.
-
(2000)
Lecture Notes in Computer Science
, vol.1807
, pp. 91-101
-
-
Coron, J.-S.1
Naccache, D.2
-
7
-
-
0001494997
-
Small solutions to polynomial equations, and low exponent rsa vulnerabilities
-
Cop97
-
[Cop97] D. Coppersmith. Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology, 10(4):233-260, 1997.
-
(1997)
J. Cryptology
, vol.10
, Issue.4
, pp. 233-260
-
-
Coppersmith, D.1
-
9
-
-
85028868533
-
Collision free hash functions and public key signature schemes
-
[Dam87] David Chaum and Wyn L. Price, editors, EUROCRYPT, Springer
-
[Dam87] I. Damgård. Collision free hash functions and public key signature schemes. In David Chaum and Wyn L. Price, editors, EUROCRYPT, volume 304 of Lecture Notes in Computer Science, pages 203-216. Springer, 1987.
-
(1987)
Lecture Notes in Computer Science
, vol.304
, pp. 203-216
-
-
Damgård, I.1
-
10
-
-
0003157491
-
On-line/off-line digital signatures
-
EGM96
-
[EGM96] S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. Journal of Cryptology, 9(1):35-67, 1996.
-
(1996)
Journal of Cryptology
, vol.9
, Issue.1
, pp. 35-67
-
-
Even, S.1
Goldreich, O.2
Micali, S.3
-
11
-
-
35248856345
-
The Cramer-shoup strong-RSA signature scheme revisited
-
[Fis03] Yvo Desmedt, editor, Public Key Cryptography, Springer
-
[Fis03] M. Fischlin. The Cramer-Shoup strong-RSA signature scheme revisited. In Yvo Desmedt, editor, Public Key Cryptography, volume 2567 of Lecture Notes in Computer Science, pages 116-129. Springer, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2567
, pp. 116-129
-
-
Fischlin, M.1
-
12
-
-
84957661041
-
Secure hash-and-sign signatures without the random oracle
-
[GHR99] Jacques Stern, editor, EUROCRYPT, Springer
-
[GHR99] R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Jacques Stern, editor, EUROCRYPT, volume 1592 of Lecture Notes in Computer Science, pages 123-139. Springer, 1999.
-
(1999)
Lecture Notes in Computer Science
, vol.1592
, pp. 123-139
-
-
Gennaro, R.1
Halevi, S.2
Rabin, T.3
-
13
-
-
0023985465
-
A digital signature scheme secure against adaptive chosen-message attacks
-
GMR88
-
[GMR88] S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.
-
(1988)
SIAM J. Comput.
, vol.17
, Issue.2
, pp. 281-308
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.L.3
-
15
-
-
84941160592
-
New online/offline signature schemes without random oracles
-
KSS06
-
[KSS06] K. Kurosawa and K. Schmidt-Samoa. New online/offline signature schemes without random oracles. Cryptology ePrint Archive, 2006. http://eprint.iacr.org/.
-
(2006)
Cryptology ePrint Archive
-
-
Kurosawa, K.1
Schmidt-Samoa, K.2
-
16
-
-
84955368946
-
More flexible exponentiation with precomputation
-
[LL94] Yvo Desmedt, editor, CRYPTO, Springer
-
[LL94] C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Yvo Desmedt, editor, CRYPTO, volume 839 of Lecture Notes in Computer Science, pages 95-107. Springer, 1994.
-
(1994)
Lecture Notes in Computer Science
, vol.839
, pp. 95-107
-
-
Lim, C.H.1
Lee, P.J.2
-
17
-
-
85015281689
-
Riemann's hypothesis and tests for primality
-
[Mil75] New York, NY, USA, ACM Press
-
[Mil75] G. L. Miller. Riemann's hypothesis and tests for primality. In Proc. of the 7th annual ACM symposium on Theory of computing (STOC '75), pages 234-239, New York, NY, USA, 1975. ACM Press.
-
(1975)
Proc. of the 7th Annual ACM Symposium on Theory of Computing (STOC '75)
, pp. 234-239
-
-
Miller, G.L.1
-
18
-
-
0004746654
-
On the security of a practical identification scheme
-
Sho99
-
[Sho99] Victor Shoup. On the security of a practical identification scheme. J. Cryptology, 12(4):24 7-260, 1999.
-
(1999)
J. Cryptology
, vol.12
, Issue.4
, pp. 247-260
-
-
Shoup, V.1
-
19
-
-
33646201706
-
Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes
-
[SST05] Ed Dawson and Serge Vaudenay, editors, Mycrypt, Springer
-
[SST05] K. Schmidt-Samoa and T. Takagi. Paillier's cryptosystem modulo p2q and its applications to trapdoor commitment schemes. In Ed Dawson and Serge Vaudenay, editors, Mycrypt, volume 3715 of Lecture Notes in Computer Science, pages 296-313. Springer, 2005.
-
(2005)
Lecture Notes in Computer Science
, vol.3715
, pp. 296-313
-
-
Schmidt-Samoa, K.1
Takagi, T.2
-
20
-
-
84880883264
-
Improved online/offline signature schemes
-
[ST01] Joe Kilian, editor, CRYPTO, Springer
-
[ST01] A. Shamir and Y. Tauman. Improved online/offline signature schemes. In Joe Kilian, editor, CRYPTO, volume 2139 of Lecture Notes in Computer Science, pages 355-367. Springer, 2001.
-
(2001)
Lecture Notes in Computer Science
, vol.2139
, pp. 355-367
-
-
Shamir, A.1
Tauman, Y.2
|