On threshold RSA-signing with no dealer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1787, Issue , 2000, Pages 197-207

  Miyazaki, Shingo ^a   Sakurai, Kouichi ^b   Yung, Moti ^c  

^a TOSHIBA CORPORATION   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c CertCo   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CONSTRUCTIVE METHODS; DISTRIBUTED AGENCIES; DISTRIBUTED COMPUTATIONS; DISTRIBUTED KEY GENERATION; THRESHOLD RSA; TRUSTED PARTY;

CRYPTOGRAPHY;

EID: 84958759867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719994_16     Document Type: Conference Paper

References (20)

1. D. Boneh and N. Daswani. “Experimenting with electronic commerce on the PalmPilot”, Proc. of Financial Cryptography‘99, LNCS, Vol. 1648, Springer-Verlag, pp. 1-16, 1999.
2. D. Boneh and M. Franklin, “Efficient generation of shared RSA keys”, Advances in Cryptology-CRYPTO‘97, LNCS 1294, pp. 425-439, 1997.
3. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. “How to share a function securely (extended summary)”. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 522-533, Montréal, Québec, Canada, 23-25 May 1994.
4. Y. Desmedt. “Threshold cryptosystems” (a survey). In Auscrypt’92, LNCS 718, pages 3-14.
5. Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures (extended abstract). In CRYPTO’91 CRYPTO91, pages 457-469.
6. Y. Desmedt and Y. Frankel, “Threshold cryptosystems”, Advances in Cryptology-CRYPTO‘89, LNCS 435, pp. 307-315, 1989.
7. Y. Frankel, P. Gemmell, P. D. MacKenzie and M. Yung, “Optimal-resilience proactive public-key cryptosystems”, 38th Annual Symposium on Foundations of Computer Science, pp. 384-393, 1997.
8. Y. Frankel, P. Gemmell, and M. Yung. Witness-based cryptographic program checking and robust function sharing. In STOC’96, pages 499-508.
9. Y. Frankel, P. D. MacKenzie and M. Yung, “Robust efficient distributed, RSA-key generation”, Proceedings of the thirtieth annual ACM symposium on theory of computing, pp. 663-672, 1998.
10. Y. Frankel, P. D. MacKenzie and M. Yung, “Pseudorandom Intermixing”: A Tool for Shared Cryptography”, To appear in Proc. of PKC’2000, International Workshop on Practice and Theory in Public Key Cryptography, January 18-20, 2000, Melbourne, Australia.
11. Y. Frankel and M. Yung, “Distributed public key cryptosystems”, (Invited Paper) Public Key Cryptography, LNCS 1431, pp. 1-13, 1998.
12. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. “Robust and efficient sharing of RSA functions”. In Advances in Cryptology—CRYPTO‘96, volume 1109 of Lecture Notes in Computer Science, pages 157-172. Springer-Verlag, 18-22 Aug. 1996.
13. S. Miyazaki and K. Sakurai, “Notes on thershold schemes in distributed RSA cryptosystems” (in Japanese), Proc. the 1999 Symposium of Cryptography and Information Security (SCIS’99), T1-3. 1, pp. 451-456. (June 1999).
14. T. Okamoto, “Threshold key-recovery systems for RSA”, Security Protocols, LNCS 1361, pp. 191-200, 1997.
15. T. P. Pedersen, “Distributed provers with applications to undeniable signatures”, Advances in Cryptology-Eurocrypt‘91, LNCS 547, pp. 221-238, 1991.
16. T. P. Pedersen, “A threshold cryptosystem without a trusted party”, Advances in Cryptology-Eurocrypt‘91, LNCS 547, pp. 522-526, 1991.
17. T. Rabin. A simplified approach to threshold and proactive rsa. In Krawczyk CRYPTO98, pages 89-104.
18. A. Shamir, “How to share a secret”, Communication ACM, 22, pp. 612-613, 1979.
19. V. Shoup, “Practical threshold signatures”, June 24, 1999, A revision of IBM Research Report RZ 3121 (April 19, 1999) available from Theory of Cryptography Library 99-11, http://philby.ucsd.edu/cryptolib/1999.html.
20. G. J. Simmons, “A’weak’ privacy protocol using the RSA cryptoalgorithm”, Cryptologia, vol. 7, pp. 180-182, 1983.