Round-efficient conference key agreement protocols with provable security

Wen-Guey Tzeng, Zhi Jia Tzeng

研究成果: Conference contribution同行評審

42 引文 斯高帕斯(Scopus)

摘要

A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. In this paper we consider the distributed conference key (conference key agreement) protocol. We present two round-efficient conference key agreement protocols, which achieve the optimum in terms of the number of rounds. Our protocols are secure against both passive and active adversaries under the random oracle model. They release no useful information to passive adversaries and achieve fault tolerance against any coalition of malicious participants. We achieve the optimal round by transferring an interactive proof system to a non-interactive version, while preserving its security capability.

原文English
主出版物標題Advances in Cryptology - ASIACRYPT 2000 - 6th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
編輯Tatsuaki Okamoto
發行者Springer Verlag
頁面614-627
頁數14
ISBN(電子)3540414045, 9783540414049
DOIs
出版狀態Published - 1 一月 2000
事件6th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2000 - Kyoto, Japan
持續時間: 3 十二月 20007 十二月 2000

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1976
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Conference

Conference6th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2000
國家Japan
城市Kyoto
期間3/12/007/12/00

指紋 深入研究「Round-efficient conference key agreement protocols with provable security」主題。共同形成了獨特的指紋。

引用此