Communication in key distribution schemes

Author

Beimel, Amos ; Chor, Benny

Author_Institution

Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

42

Issue

1

fYear

1996

fDate

1/1/1996 12:00:00 AM

Firstpage

19

Lastpage

28

Abstract

A (g, b) key distribution scheme allows conferences of g users to generate secret keys, such that disjoint coalitions of b users cannot gain any information on the generated key (in the information-theoretic sense). We study the relationships between communication and space efficiency of key distribution schemes. We prove that communication does not help in the context of unrestricted schemes. On the other hand, we show that for restricted schemes, which are secure only when used by a limited number of conferences, communication can substantially improve the space efficiency. We also present lower bounds on the space efficiency of restricted schemes

Keywords

cryptography; information theory; communication; conferences; disjoint coalitions; information theory; key distribution schemes; lower bounds; restricted schemes; secret keys; space efficiency; unrestricted schemes; Computer science; Context; Cryptographic protocols; Cryptography; Entropy; Information security; Information theory;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.481774

Filename

481774