Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, TYen_US
dc.contributor.authorYang, CCen_US
dc.contributor.authorHwang, MSen_US
dc.date.accessioned2014-12-08T15:38:45Z-
dc.date.available2014-12-08T15:38:45Z-
dc.date.issued2004-08-01en_US
dc.identifier.issn0167-739Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.future.2003.09.005en_US
dc.identifier.urihttp://hdl.handle.net/11536/26523-
dc.description.abstractIn this paper, we shall propose a (t, n) threshold signature with (k, l) threshold-shared verification to be used in a group-oriented cryptosystem without a shared distribution center (SDC). In this scheme, any t participants can represent a group (signing group) to sign a message, and any k participants can represent another group (verifying group) to verify the signature. We need no SDC to distribute the public and private keys to all the participants in the two groups. Hence, our scheme is more practical in real-world applications and more efficient than its predecessors in terms of communication and computational complexity as well as storage. (C) 2003 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectcryptosystemen_US
dc.subjectdigital signaturesen_US
dc.subjectelliptic curvesen_US
dc.subjectsecret sharingen_US
dc.subjectthreshold cryptosystemen_US
dc.titleA threshold signature scheme for group communications without a shared distribution centeren_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.doi10.1016/j.future.2003.09.005en_US
dc.identifier.journalFUTURE GENERATION COMPUTER SYSTEMSen_US
dc.citation.volume20en_US
dc.citation.issue6en_US
dc.citation.spage1013en_US
dc.citation.epage1021en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000223366600014-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000223366600014.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.