Interaction in key distribution schemes

Amos Beimel, Benny Chor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationAdvances in Cryptology ─ CRYPT0 1993 - 13th Annual International Cryptology Conference, Proceedings
EditorsDouglas R. Stinson
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540577669
StatePublished - 1994
Externally publishedYes
Event13th Annual International Conference on Advances in Cryptology, CRYPT0 1993 - Santa Barbara, United States
Duration: 22 Aug 199326 Aug 1993

Publication series

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


Conference13th Annual International Conference on Advances in Cryptology, CRYPT0 1993
Country/TerritoryUnited States
CitySanta Barbara


Dive into the research topics of 'Interaction in key distribution schemes'. Together they form a unique fingerprint.

Cite this