-
1
-
-
84937431456
-
Efficient computation modulo a shared secret with application to the generation of shared safe-prime products
-
Yung, M, ed, CRYPTO 2002, Springer, Heidelberg
-
Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417-432. Springer, Heidelberg (2002)
-
(2002)
LNCS
, vol.2442
, pp. 417-432
-
-
Algesheimer, J.1
Camenisch, J.2
Shoup, V.3
-
3
-
-
84958639277
-
Efficient generation of shared RSA keys (extended abstract)
-
Kaliski Jr, B.S, ed, CRYPTO 1997, Springer, Heidelberg
-
Boneh, D., Franklin, M.K.: Efficient generation of shared RSA keys (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 425-439. Springer, Heidelberg (1997)
-
(1997)
LNCS
, vol.1294
, pp. 425-439
-
-
Boneh, D.1
Franklin, M.K.2
-
4
-
-
4243114091
-
Efficient generation of shared RSA keys
-
Boneh, D., Franklin, M.K.: Efficient generation of shared RSA keys. J. ACM 48(4), 702-722 (2001)
-
(2001)
J. ACM
, vol.48
, Issue.4
, pp. 702-722
-
-
Boneh, D.1
Franklin, M.K.2
-
5
-
-
84947749920
-
-
Boneh, D., Horwitz, J.: Generating a product of three primes with an unknown factorization. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, 1423, pp. 237-251. Springer, Heidelberg (1998)
-
Boneh, D., Horwitz, J.: Generating a product of three primes with an unknown factorization. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 237-251. Springer, Heidelberg (1998)
-
-
-
-
6
-
-
84948973732
-
Efficient proofs that a committed number lies in an interval
-
Preneel, B, ed, EUROCRYPT 2000, Springer, Heidelberg
-
Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 431-444. Springer, Heidelberg (2000)
-
(2000)
LNCS
, vol.1807
, pp. 431-444
-
-
Boudot, F.1
-
7
-
-
28144462281
-
Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive
-
Report 2000/067 , version
-
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (2000) (2005 version)
-
(2000)
-
-
Canetti, R.1
-
8
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
-
(2001)
FOCS
, pp. 136-145
-
-
Canetti, R.1
-
9
-
-
21144458613
-
-
Cramer, R., Damgård, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, 3378, pp. 342-362. Springer, Heidelberg (2005)
-
Cramer, R., Damgård, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342-362. Springer, Heidelberg (2005)
-
-
-
-
10
-
-
84958774556
-
A statistically-hiding integer commitment scheme based on groups with hidden order
-
Zheng, Y, ed, ASIACRYPT 2002, Springer, Heidelberg
-
Damgård, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125-142. Springer, Heidelberg (2002)
-
(2002)
LNCS
, vol.2501
, pp. 125-142
-
-
Damgård, I.1
Fujisaki, E.2
-
11
-
-
84966230027
-
Average case error estimates for the strong probable prime test
-
Damgård, I., Landrock, P., Pomerance, C.: Average case error estimates for the strong probable prime test. Mathematics of Computation 61(203), 177-194 (1993)
-
(1993)
Mathematics of Computation
, vol.61
, Issue.203
, pp. 177-194
-
-
Damgård, I.1
Landrock, P.2
Pomerance, C.3
-
12
-
-
67049098750
-
-
Damgård, I., Mikkelsen, G.L.: On the theory and practice of personal digital signatures. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, 5443, pp. 277-296. Springer, Heidelberg (2009)
-
Damgård, I., Mikkelsen, G.L.: On the theory and practice of personal digital signatures. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 277-296. Springer, Heidelberg (2009)
-
-
-
-
13
-
-
33745808735
-
-
Damgård, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, 3958, pp. 75-90. Springer, Heidelberg (2006)
-
Damgård, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 75-90. Springer, Heidelberg (2006)
-
-
-
-
14
-
-
0031628726
-
Robust efficient distributed RSA-key generation
-
Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed RSA-key generation. In: STOC, pp. 663-672 (1998)
-
(1998)
STOC
, pp. 663-672
-
-
Frankel, Y.1
MacKenzie, P.D.2
Yung, M.3
-
15
-
-
84958615646
-
Statistical zero knowledge protocols to prove modular polynomial relations
-
Kaliski Jr, B.S, ed, CRYPTO 1997, Springer, Heidelberg
-
Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16-30. Springer, Heidelberg (1997)
-
(1997)
LNCS
, vol.1294
, pp. 16-30
-
-
Fujisaki, E.1
Okamoto, T.2
-
16
-
-
77949573851
-
-
RSA Laboratories. PKCS #1 v2.1: RSA cryptography standard. Technical report (2002)
-
RSA Laboratories. PKCS #1 v2.1: RSA cryptography standard. Technical report (2002)
-
-
-
-
17
-
-
0345058958
-
On diophantine complexity and statistical zero-knowledge arguments
-
Laih, C.-S, ed, ASIACRYPT 2003, Springer, Heidelberg
-
Lipmaa, H.: On diophantine complexity and statistical zero-knowledge arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 398-415. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2894
, pp. 398-415
-
-
Lipmaa, H.1
-
18
-
-
77949572714
-
-
Malkin, M., Wu, T.D., Boneh, D.: Experimenting with shared generation of RSA keys. In: NDSS. The Internet Society (1999)
-
Malkin, M., Wu, T.D., Boneh, D.: Experimenting with shared generation of RSA keys. In: NDSS. The Internet Society (1999)
-
-
-
-
19
-
-
33845432604
-
Probabilistic algorithm for testing primality
-
Rabin, M.O.: Probabilistic algorithm for testing primality. Journal of Number Theory 12(1), 128-138 (1980)
-
(1980)
Journal of Number Theory
, vol.12
, Issue.1
, pp. 128-138
-
-
Rabin, M.O.1
-
20
-
-
0018545449
-
How to share a secret
-
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612-613 (1979)
-
(1979)
Commun. ACM
, vol.22
, Issue.11
, pp. 612-613
-
-
Shamir, A.1
|