Skip to main content

A Conference Key Multicasting Scheme Using Knapsack and Secret Sharing

  • Conference paper
  • First Online:
  • 421 Accesses

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

Abstract

In this paper, a conference key multicasting scheme is proposed and analyzed. Each Network user U i is associated with a key pair (x i , Y i ), where x i is a secret key and y i is a public key. A sealed lock is constructed from the public keys so that conference key can be enciphered by a chairperson and broadcasted to users in the network system, while only the authorized participants can recover the conference key. The packed sum property aspect of the well known knapsack problem together with the concept of secret sharing is utilized to accomplish the construction of a sealed lock.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. H. Chiou and W. T. Chen, “Secure Broadcasting Using the Secure Lock,” IEEE Trans. Software Engineering, Vol. 15, No. 8, 1989, pp. 929–934.

    Article  Google Scholar 

  2. W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, Vol. 22, No. 6, 1976, pp. 644–654.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Elgarmal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, Vol. 31, No. 4, 1985, pp. 469–472.

    Article  Google Scholar 

  4. I. Ingemarsson, D. T. Tang and C. K. Wang, “A Conference Key Distribution System,” IEEE Trans. Information Theory, Vol. 28, No. 5, 1982, pp. 714–720.

    Article  MATH  Google Scholar 

  5. C. H. Lin, C. C. Chang and R. C. T. Lee, “A Conference Key Broadcasting System Using Sealed Locks,” Information Systems. Vol. 17, No. 4, 1992, pp. 323–328.

    Article  MATH  Google Scholar 

  6. S. Martello and P. Toth, Knapsack Problem: Algorithms and Computer Implementations, John Wiley & Sons, England, 1990.

    MATH  Google Scholar 

  7. R. C. Merkle and M. E. Hellman, “Hiding Information and Signatures in Trapdoor Knapsacks,” IEEE Trans. Information Theory, Vol. 24, No. 5, 1978, pp. 525–530.

    Article  Google Scholar 

  8. A. Shamir, “Embedding Cryptography Trapdoors in Arbitrary Knapsack Systems,” Information Processing Letters, Vol. 17, No. 2, 1983, pp. 77–79.

    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

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, SJ., Chang, JF. (1999). A Conference Key Multicasting Scheme Using Knapsack and Secret Sharing. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66448-2

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics