Skip to main content

Generalized threshold cryptosystems

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Included in the following conference series:

Abstract

In a threshold cryptosystem, one can send an encrypted message to a group without knowing the internal secret sharing policy of the group. The encrypted ciphertext can only be deciphered by some users of the group according to the secret sharing policy. In this paper, we propose solutions to handle the generalized secret sharing policy. In addition, we investigate two different models for the group: one with a mutually trusted party in the group and the other one without.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Goldreich, S. Micali, and A Wigderson. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. Theory of Computing, STOC, pp. 218–229, May 25–27, 1987.

    Google Scholar 

  2. Y. Desmedt. Society and group oriented cryptography: a new concept. In Advances in Cryptology, Proc. of Crypto '87, pp. 120–127, August 16–20, 1988.

    Google Scholar 

  3. Y Frankel. A practical protocol for large group oriented networks. To appear in: Advances in Cryptology, Proc. of Eurocrypt '89, April, 1989.

    Google Scholar 

  4. T. ElGamel. A public key cryptosystem and a signature scheme based on discrete logarithms. In IEEE Trans. Inform. Theory, Vol. IT-31, pp. 469–472, July, 1985.

    Article  Google Scholar 

  5. Y. Desmedt, and Y. Frankel. Threshold cryptosystem. In Advances in Cryptology, Proc. of Crypto '89, pp. 307–315, August 20–24, 1989.

    Google Scholar 

  6. R. L. Rivest, A. Shamir, and L. Adelman. A method for obtaining digital signatures and public-key cryptosystem. In Commun. of ACM, Vol. 21, No. 2, pp. 120–126, Feb. 1978.

    Article  Google Scholar 

  7. J. Benaloh, and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology, Proc. of Crypto '88, pp. 27–35, August 21–25, 1988.

    Google Scholar 

  8. W. Diffie, and M. E. Hellman. New directions in cryptography. In IEEE Trans. Inform. Theory, Vol. IT-22, pp. 644–654, Nov. 1976.

    Article  Google Scholar 

  9. I. Ingemarsson, and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. To appear in: Advances in Cryptology, Proc. of Eurocrypt '90, May 21–24, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laih, C.S., Harn, L. (1993). Generalized threshold cryptosystems. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics