Interaction in key distribution schemes

Amos Beimel; Benny Chor

doi:10.1007/3-540-48329-2_38

Interaction in key distribution schemes

Amos Beimel, Benny Chor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

23 Scopus citations

Abstract

A (g,b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of zcnrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.

Original language	English
Title of host publication	Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings
Editors	Douglas R. Stinson
Publisher	Springer Verlag
Pages	444-455
Number of pages	12
ISBN (Print)	9783540577669
DOIs	https://doi.org/10.1007/3-540-48329-2_38
State	Published - 1993
Externally published	Yes
Event	13th Annual International Conference on Advances in Cryptology, CRYPT0 1993 - Santa Barbara, United States Duration: 22 Aug 1993 → 26 Aug 1993

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	773 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th Annual International Conference on Advances in Cryptology, CRYPT0 1993
Country/Territory	United States
City	Santa Barbara
Period	22/08/93 → 26/08/93

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/3-540-48329-2_38

Cite this

Beimel, A., & Chor, B. (1993). Interaction in key distribution schemes. In D. R. Stinson (Ed.), Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings (pp. 444-455). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 773 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-48329-2_38

Beimel, Amos ; Chor, Benny. / Interaction in key distribution schemes. Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings. editor / Douglas R. Stinson. Springer Verlag, 1993. pp. 444-455 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6c755651322e4cabb233ee866cb5a0ef,

title = "Interaction in key distribution schemes",

abstract = "A (g,b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of zcnrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.",

author = "Amos Beimel and Benny Chor",

note = "Funding Information: * Supported by the Fund for the Promotion of Research at the Technion. ** email: beimelQca .t echnion .a c .il *** ernail: benny@cs.technion.ac.il Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 13th Annual International Conference on Advances in Cryptology, CRYPT0 1993 ; Conference date: 22-08-1993 Through 26-08-1993",

year = "1993",

doi = "10.1007/3-540-48329-2_38",

language = "English",

isbn = "9783540577669",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "444--455",

editor = "Stinson, {Douglas R.}",

booktitle = "Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings",

address = "Germany",

}

Beimel, A & Chor, B 1993, Interaction in key distribution schemes. in DR Stinson (ed.), Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 773 LNCS, Springer Verlag, pp. 444-455, 13th Annual International Conference on Advances in Cryptology, CRYPT0 1993, Santa Barbara, United States, 22/08/93. https://doi.org/10.1007/3-540-48329-2_38

Interaction in key distribution schemes. / Beimel, Amos; Chor, Benny.

Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings. ed. / Douglas R. Stinson. Springer Verlag, 1993. p. 444-455 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 773 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Interaction in key distribution schemes

AU - Beimel, Amos

AU - Chor, Benny

N1 - Funding Information: * Supported by the Fund for the Promotion of Research at the Technion. ** email: beimelQca .t echnion .a c .il *** ernail: benny@cs.technion.ac.il Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1994.

PY - 1993

Y1 - 1993

N2 - A (g,b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of zcnrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.

AB - A (g,b) key distribution scheme allows conferences of g users to generate secret keys, so that disjoint coalitions of b users cannot gain any information on the key (in the information theoretic sense). In this work we study the relationships between interaction and space efficiency of key distribution schemes. We prove that interaction does not help in the context of zcnrestricted schemes. On the other hand, we show that for restricted schemes, which are secure for a limited number of conferences, interaction can substantially improve the space efficiency.

UR - http://www.scopus.com/inward/record.url?scp=0005944705&partnerID=8YFLogxK

U2 - 10.1007/3-540-48329-2_38

DO - 10.1007/3-540-48329-2_38

M3 - Conference contribution

AN - SCOPUS:0005944705

SN - 9783540577669

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 444

EP - 455

BT - Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings

A2 - Stinson, Douglas R.

PB - Springer Verlag

T2 - 13th Annual International Conference on Advances in Cryptology, CRYPT0 1993

Y2 - 22 August 1993 through 26 August 1993

ER -

Beimel A, Chor B. Interaction in key distribution schemes. In Stinson DR, editor, Advances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings. Springer Verlag. 1993. p. 444-455. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-48329-2_38

Interaction in key distribution schemes

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this