DocumentCode
2487819
Title
Unconditionally secure dynamic conference key distribution
Author
Desmedt, Yvo ; Viswanathan, Vaidhyanathan
Author_Institution
Wisconsin Univ., Milwaukee, WI, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
383
Abstract
We present a non-interactive conference key distribution protocol in which all n users receive initial secrets from a trusted server. When a subset of the n users want to communicate privately, each of the users involved can without interaction compute the common key. We prove that the length of the initial secrets we use, are optimal
Keywords
protocols; security of data; teleconferencing; noninteractive conference key distribution protocol; optimal initial secrets length; secure dynamic conference key distribution; trusted server; Bismuth; Computer networks; Computer security; Cryptography; Distributed computing; Electronic mail; Entropy; Mathematics; Random variables; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708988
Filename
708988
Link To Document