无条件安全的动态会议密钥分发

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.708988

Y. Desmedt, Vaidhyanathan Viswanathan

{"title":"无条件安全的动态会议密钥分发","authors":"Y. Desmedt, Vaidhyanathan Viswanathan","doi":"10.1109/ISIT.1998.708988","DOIUrl":null,"url":null,"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.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Unconditionally secure dynamic conference key distribution\",\"authors\":\"Y. Desmedt, Vaidhyanathan Viswanathan\",\"doi\":\"10.1109/ISIT.1998.708988\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

摘要

我们提出了一种非交互式会议密钥分发协议，其中所有n个用户从可信服务器接收初始密钥。当n个用户中的一个子集想要私下通信时，每个用户都可以在没有交互的情况下计算公共密钥。我们证明了我们使用的初始秘密的长度是最优的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Unconditionally secure dynamic conference key distribution

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量