Skip to main content

A Method for Sending Confidential Messages to a Group without Trusted Parties

  • Conference paper
  • First Online:
Parallel and Distributed Processing and Applications (ISPA 2003)

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

  • 349 Accesses

Abstract

A simple and efficient method to send confidential messages to a group is proposed in this paper. Firstly, we show a practical and efficient generalized secret sharing scheme based on simple operations. Next, we propose a special design concept to construct a generalized group-oriented cryptosystem (GGOC) [5]. Any group can use our design concept to construct a GGOC which provides a secure environment for a sender to send confidential messages to it. The constructed GGOC does not need the assistance of any trusted party. We also apply our design concept to construct a GGOC based on RSA, DES, and our generalized secret sharing scheme. As a result, our new GGOC is simple and easy to implement in hardware. We also show that our proposed GGOC is practical and is more efficient than Chang and Lee’s GGOC.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Benaloh, J. and Leichter, J. “Generalized Secret Sharing and Monotone Functions,” Advances in Cryptology: Crypto’88, New York: Springer-Verlag, 1989, pp. 27–35.

    Google Scholar 

  2. Blundo, C., Santis, A. D., Crescenzo, G. D., Gaggia, A. G., and Vaccaro, U. “Multi-Secret Sharing Schemes,” Advances in Cryptology: Crypto’94, New York: Springer-Verlag, 1995, pp. 150–163.

    Google Scholar 

  3. Cachin, C. “On-line Secret Sharing,” Cryptography and Coding, Springer-Verlag, Berlin, 1994, pp. 190–198.

    Google Scholar 

  4. Chang, C. C. and Hwang, R. J. “An Efficient Cheater Identification Method for Threshold Schemes,” IEE Proceedings-Computers and Digital Techniques, vol. 144, No. 1, 1997, pp. 23–27.

    Article  MATH  Google Scholar 

  5. Chang, C. C. and Lee, H. C. “A New Generalized Group-Oriented Cryptoscheme Without Trusted Centers,” IEEE Journal on Selected Areas in Communications, Vol. 11, No. 5, 1993, pp. 725–729.

    Article  Google Scholar 

  6. Desmedt, Y. “Society and Group Oriented Cryptography: A New Concept,” Advances in Cryptology: Crypto’87, New York: Springer-Verlag, 1988, pp. 120–127.

    Google Scholar 

  7. Hwang, T. “Cryptosystem for Group Oriented Cryptography,” Advances in Cryptology: Eurocrypt’90, New York: Springer-Verlag, 1990, pp. 317–324.

    Google Scholar 

  8. Ingemarsson, I. and Simmons, G. L. “A Protocol to Set up Shared Secret Schemes without the Assistance of a Mutually Trusted Party,” Advances in Cryptology: Eurocrypt’90, New York: Springer-Verlag, 1990, pp. 266–282.

    Google Scholar 

  9. Lai, X. On the Design and Security of Block Ciphers, ETH Series in Information Processing, Konstanz: Hartung-Gorre Verlag, 1992.

    Google Scholar 

  10. Rivest, R. L., Shamir, A. and Adleman, L. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” Communications of ACM, Vol. 21, No. 2, 1978, pp. 120–126.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hwang, RJ., Chang, CC. (2003). A Method for Sending Confidential Messages to a Group without Trusted Parties. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics