Advertisement

Improved Methods to Perform Threshold RSA

  • Brian King
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1976)

Abstract

A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than t participants gain no information about the secret. In [4], Desmedt and Frankel introduced a threshold scheme that can be used with any finite Abelian group. Hence it can be used to provide threshold RSA. In this scheme, the size of the share is on the order n times the size of the secret. Further, due to a complicated algebraic setting, and the large shares, this schemes requires a “large” amount of computations. Recent work have addressed how to reduce the resource requirements. Within this paper we provide improved methods and demonstrate the computational requirements of the Desmedt- Frankel scheme using our method is, in many cases, better than other existing threshold RSA signature schemes.

Keywords:

threshold secret sharing threshold cryptography threshold RSA cyclotomic polynomials 

References

  1. 1.
    W. Adkins and S. Weintrab. Algebra, an approach via module theory. Springer-Verlag, NY, 1992.zbMATHGoogle Scholar
  2. 2.
    G. Blakley. “Safeguarding cryptographic keys.” In Proc. Nat. Computer Conf. AFPIPS Conf. Proc., 48 pp. 313–317, 1979.Google Scholar
  3. 3.
    A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. “How to share a function”. In Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC), pp. 522–533, 1994.Google Scholar
  4. 4.
    Y. Desmedt and Y. Frankel. “Homomorphic zero-knowledge threshold schemes over any finite abelian group”. In Siam J. Disc. Math. vol 7, no. 4 pp. 667–679, SIAM, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Y. Desmedt and Y. Frankel. Threshold Cryptosystems In Advances of Cryptology-Crypto’ 89, pp. 307–315, 1989.Google Scholar
  6. 6.
    Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In Advances of Cryptology-Crypto’ 91, 1991.Google Scholar
  7. 7.
    Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Tech. Report ISSE-TR-97-01, George Mason University, July 1997 ftp://isse.gmu.edu/pub/techrep/97.01.jajodia.ps.gz
  8. 8.
    Y. Desmedt, B. King, W. Kishimoto, and K. Kurosawa, “A comment on the efficiency of secret sharing scheme over any finite abelian group”, In Information Security and Privacy, ACISP’98 (Third Australasian Conference on Information Security and Privacy), LNCS 1438, 1998, 391–402.CrossRefGoogle Scholar
  9. 9.
    Y. Frankel. A practical protocol for large group oriented networks. In Advances of Cryptology-Eurocrypt’ 89, Lecture Notes in Computer Science 434, Springer Verlag, 1990, pp 56–61.Google Scholar
  10. 10.
    Y. Frankel and Y. Desmedt. Parallel reliable threshold multisignature. Tech. report TR-92-04-02, Univ. of Wisconsin-Milwaukee, 1992.Google Scholar
  11. 11.
    Y. Frankel, P. Gemmel, P. Mackenzie, and M. Yung. Proactive RSA In Advances of Cryptology-Crypto’ 97, 1997 Lecture Notes in Computer Science 1294, Springer Verlag, 1997, pp 440–454.CrossRefGoogle Scholar
  12. 12.
    Y. Frankel, P. Gemmel, P. Mackenzie, and M. Yung. Optimal-Resilience Proactive Public-key Cryptosystems In Proc. 38th FOCS, pp 384–393, IEEE, 1997Google Scholar
  13. 13.
    R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances of Cryptology-Crypto’ 96, Lecture Notes in Computer Science 1109, Springer Verlag, 1996, pp 157–172.CrossRefGoogle Scholar
  14. 14.
    T. Hungerford. Algebra. Springer-Verlag, NY, 1974.zbMATHGoogle Scholar
  15. 15.
    B. King. Algorithms to speed up computations in threshold RSA, Australasian Conference on Information Security and Privacy 2000.Google Scholar
  16. 16.
    H.L. Keng. Introduction to Number Theory. Springer Verlag, NY 1982zbMATHGoogle Scholar
  17. 17.
    T. Rabin. A Simplified Approach to threshold and proactive RSA. In Advances of Cryptology-Crypto’ 98, 1998Google Scholar
  18. 18.
    R. Rivest, A. Shamir, and L. Adelman, A method for obtaining digital signatures and public key cryptosystems, Comm. ACM, 21(1978), pp 294–299.CrossRefGoogle Scholar
  19. 19.
    A. Shamir, How to share a secret, Comm. ACM, 22(1979), pp 612–613.zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    V. Shoup. “Practical Threshold Signatures” In Advances of Cryptology-Eurocrypt 2000, pp 207–220.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Brian King
    • 1
    • 2
  1. 1.University of Wisconsin-MilwaukeeMilwaukeeUSA
  2. 2.Motorola LabsSchaumburgUSA

Personalised recommendations