Full metadata record
DC FieldValueLanguage
dc.contributor.authorTzeng, WGen_US
dc.date.accessioned2014-12-08T15:42:32Z-
dc.date.available2014-12-08T15:42:32Z-
dc.date.issued2002-04-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://dx.doi.org/10.1109/12.995447en_US
dc.identifier.urihttp://hdl.handle.net/11536/28883-
dc.description.abstractWhen a group of people want to communicate securely over an open network, they run a conference-key protocol to establish a common conference key K such that all their communications thereafter are encrypted with the key K. In this paper, we propose a provably secure fault-tolerant conference-key agreement protocol under the authenticated broadcast channel model. We show that a passive adversary gets zero knowledge about the conference key established by the honest participants under the assumption of a variant Diffie-Hellman decision problem. We also show that the honest participants can agree on a common conference key no matter how many participants are malicious. Furthermore, we show that even if the broadcast channel is not authenticated, our protocol is secure against impersonators under the random oracle model.en_US
dc.language.isoen_USen_US
dc.subjectconference keyen_US
dc.subjectprovable securityen_US
dc.subjectfault toleranceen_US
dc.titleA secure fault-tolerant conference-key agreement protocolen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/12.995447en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume51en_US
dc.citation.issue4en_US
dc.citation.spage373en_US
dc.citation.epage379en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000174745100002-
dc.citation.woscount40-
Appears in Collections:Articles


Files in This Item:

  1. 000174745100002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.