https://scholars.lib.ntu.edu.tw/handle/123456789/352528
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Huang, Kuo-Hsuan | en_US |
dc.contributor.author | Chung, Yu-Fang | en_US |
dc.contributor.author | Lee, Hsiu-Hui | en_US |
dc.contributor.author | FEI-PEI LAI | en_US |
dc.contributor.author | Chen, Tzer-Shyong | en_US |
dc.creator | Huang, Kuo-Hsuan;Chung, Yu-Fang;Lee, Hsiu-Hui;Lai, Feipei;Chen, Tzer-Shyong | - |
dc.date.accessioned | 2018-09-10T07:43:13Z | - |
dc.date.available | 2018-09-10T07:43:13Z | - |
dc.date.issued | 2009-02 | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-56049116231&doi=10.1016%2fj.csi.2008.05.015&partnerID=40&md5=27f8b60967502ec90a37b4cb45bd30c3 | - |
dc.description.abstract | Secure communication is of utmost importance to participants of Internet conferences. Secure communication thwarts eavesdropping. In an Internet conference, all conference participants together establish a common conference key to enable multi-party and secure exchange of messages. However, malicious conference participants may try to obtain the conference key through unfair means, and this could result in the generation of different conference keys. This paper is intended as a proposal of a new form of conference key agreement protocol. It emphasizes the filtering of malicious participants at the beginning of the conference to ensure that all participants obtain the same conference key. The proposed method also has fault-tolerant capability. Efficiency and security of a protocol is important in practice. The security of the proposed protocol is based on discrete logarithm problem assumption. The protocol is executed in computationally secure environment. The secret information of a user cannot be determined from its corresponding public information and therefore ensures privacy. Since efficiency of a protocol depends on low computation cost, the protocol attempts to achieve lower computation cost without compromising on security. © 2008 Elsevier B.V. All rights reserved. | - |
dc.format | application/pdf | en |
dc.format.extent | 197267 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | en | en |
dc.relation | Computer Standards & Interfaces 31 (2): 401-405 | en |
dc.relation.ispartof | The Journal of Computer Standards & Interfaces | en_US |
dc.source | AH-anncc | - |
dc.subject | Conference key; Discrete logarithm problem; Fault tolerance; Key agreement | - |
dc.subject.other | Algebra; Fault tolerance; Internet; Quality assurance; Reliability; Security of data; Computation costs; Conference key; Conference key agreements; Conference keys; Discrete logarithm problem; Discrete Logarithm problems; Fault-tolerant; Key agreement; Malicious participants; New forms; Public informations; Secret informations; Secure communications; Internet protocols | - |
dc.title | A Conference Key Agreement Protocol with Fault-tolerant Capability | - |
dc.type | journal article | en |
dc.identifier.doi | 10.1016/j.csi.2008.05.015 | - |
dc.identifier.scopus | 2-s2.0-56049116231 | - |
dc.identifier.isi | WOS:000261868200021 | - |
dc.relation.pages | 401-405 | - |
dc.relation.journalvolume | 31 | - |
dc.relation.journalissue | 2 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | journal article | - |
item.grantfulltext | open | - |
item.cerifentitytype | Publications | - |
item.fulltext | with fulltext | - |
crisitem.author.dept | Biomedical Electronics and Bioinformatics | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Electrical Engineering | - |
crisitem.author.orcid | 0000-0003-0179-7325 | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
顯示於: | 生醫電子與資訊學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。