Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/191177.191195acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article
Free access

On key distribution via true broadcasting

Published: 02 November 1994 Publication History

Abstract

We consider true broadcast systems for the secure communication of session keys. These schemes provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting. We begin by introducing a conceptual framework for true broadcasting and illustrate its design with a secure key broadcast scheme based on probabilistic encryption. The framework provides for a system requiring user anonymity, as a result of the absence of addressing for the broadcast message. We also illustrate how Shamir's threshold scheme can be altered to allow for parallel broadcasting. We then present a formal model and use information theoretic techniques to establish a lower bound on the size of the broadcast message for a class of true broadcast schemes. Finally, we improve upon the aforementioned threshold scheme such that it achieves the lower bound.

References

[1]
Berkovits, S., "How to Broadcast a Secret", Advances in Cryploiogy: Proceedings of E URO- CRYPT '91, Springer-Verlag, 1992, pp.536-541.
[2]
Blakley, G., "One-time pads are Key Safeguarding Schemes, not Cryptosystems: Fast Key Safeguarding Schemes (Threshold Schemes) Exist", Proceedings of IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1980, pp.108-113.
[3]
Blakley, B., Blakley, G., Chan, A., Massey, J., "Threshold Schemes With Disenrollment", Advances in Cryptology: Proceedings of CRYPTO 'g2, Springer-Verlag.
[4]
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M., "Perfectly-Secure Key Distribution for Dynamic Conferences", Advances in Crvptology: Proceedings of CRYPTO '92, Springer-Verlag, 1993, pp.478-493.
[5]
Blundo, C., Cresti, A., "Space Requirements for Broadcast Encryption", to appear in Advances in Crvptology: Proceedings of bTurocrvpf '94, Springer-Verlag.
[6]
Capocelli, R., De Santis, A., Gargano, L., Vactaro, U., "On the Size of Shares for Secret Sharing Schemes", Advances in Crvptology: Proceedings of CRYPTO '91, Springer-Verlag, 1992, pp.101-113.
[7]
Chang, C.C., Hwang, S.J., "A Secure Broadcasting Scheme Based on Discrete Logarithms", Control and Computers, Vol.20, No.2, 1992, pp.49-53.
[8]
Chiou, G.H., Chen, W.T., "Secure Broadcasting Using the Secure Lock", IEEE Transactions on Software Engineering, Vol.15, No.8, August 1989, pp.929-934.
[9]
Fiat, A., Naor, M., "Broadcast Encryption", to appear in Advances in Crvptology: Proceedings of CR YPTO '93, Springer-Verlag.
[10]
Fortier, M., "A Store-and-Forward Architecture for Video-on-Demand Service", presented at Multimedia Communications '93, Banff, Alberta, Aug.13-16, 1993, pp.262-268.
[11]
Goldwasser, S., Micali, S., "Probabilistic Encryption", Journal of Computer and System Sciences, Vol.28, 1984, pp.270-299.
[12]
Gopal, J., Jaffe, M., "Point-to-multipoint Communication over Broadcast Links", IEEE Transactions on Communications, COM-32(9), 1982, pp.1034-1044.
[13]
Jumarie, G., Relative Information: Theories and Applications, Springer-Verlag, Berlin, 1990.
[14]
Krawczyk, H., "Secret Sharing Made Short", to appear in Advances in Cryptology: Proceedings of CR YPTO '93, Springer-Verlag.
[15]
Laih, C., Lee, J., Ham, L., "A New Threshold Scheme and its Applications in Designing the Conference Key Distribution Cryptosystem", Information Processing Letters, Vol.32, 1989, pp.95- 99.
[16]
Lin, C.H., Chang, C.C., Lee, R.C., "A Conference Key Broadcasting System Using Sealed Locks", Information Systems, Vol.17, No.4, 1992, pp.323- 328.
[17]
Shamir, A., "How to Share a Secret", Communications of lhe ACM, Vol.22, No.ll, November 1979, pp.612-613.
[18]
Shannon, C., "Communication Theory of Secrecy Systems", Bell System Technical Journal, Vol.28, 1949, pp.656-715.
[19]
Simmons, G., "An Introduction to Shared Secret and/or Shared Control Schemes and their Application", Contemporary Cryptology, IEEE Press, 1991, pp.441-497.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CCS '94: Proceedings of the 2nd ACM Conference on Computer and communications security
November 1994
293 pages
ISBN:0897917324
DOI:10.1145/191177
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 1994

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. broadcast encryption
  2. key distribution
  3. secret sharing

Qualifiers

  • Article

Conference

CCS94
Sponsor:

Acceptance Rates

CCS '94 Paper Acceptance Rate 31 of 70 submissions, 44%;
Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)45
  • Downloads (Last 6 weeks)12
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2019)A Computation-Efficient Group Key Distribution Protocol Based on a New Secret Sharing SchemeInformation10.3390/info1005017510:5(175)Online publication date: 10-May-2019
  • (2016)On the (In)Security of Recent Group Key Distribution ProtocolsThe Computer Journal10.1093/comjnl/bxw061Online publication date: 12-Sep-2016
  • (2010)Original Research PaperAd Hoc Networks10.1016/j.adhoc.2009.11.0058:6(597-613)Online publication date: 1-Aug-2010
  • (2009)KTRIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2008.126:3(188-201)Online publication date: 1-Jul-2009
  • (2007)Efficient Self-healing Key Distribution with Revocation for Wireless Sensor Networks Using One Way Key ChainsProceedings of the 5th international conference on Applied Cryptography and Network Security10.1007/978-3-540-72738-5_25(385-400)Online publication date: 5-Jun-2007
  • (2004)A key-chain-based keying scheme for many-to-many secure group communicationACM Transactions on Information and System Security10.1145/1042031.10420337:4(523-552)Online publication date: 11-Nov-2004
  • (2004)Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structuresTheoretical Computer Science10.1016/j.tcs.2004.02.030320:2-3(269-291)Online publication date: 14-Jun-2004
  • (2004)The Key Establishment ProblemFoundations of Security Analysis and Design II10.1007/978-3-540-24631-2_2(44-90)Online publication date: 2004
  • (2003)Constructing general dynamic group key distribution schemes with decentralized user joinProceedings of the 8th Australasian conference on Information security and privacy10.5555/1760479.1760531(464-475)Online publication date: 9-Jul-2003
  • (2003)Efficient self-healing group key distribution with revocation capabilityProceedings of the 10th ACM conference on Computer and communications security10.1145/948109.948141(231-240)Online publication date: 27-Oct-2003
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media