| dc.contributor | 資科系 | |
| dc.creator (作者) | Tso, Ray-Lin;Yi, X.;Ito, T.;Okamoto, T.;Okamoto, E. | |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.date (日期) | 2010 | |
| dc.date.accessioned | 17-Apr-2015 16:49:27 (UTC+8) | - |
| dc.date.available | 17-Apr-2015 16:49:27 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Apr-2015 16:49:27 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/74681 | - |
| dc.description.abstract (摘要) | This paper presents a new kind of (k,n)-threshold ring signature ((k,n)-ring signature) which is just a combination of k (1,n)-ring signatures. Our construction guarantees that a single signer can close at most one ring so the result of the combination is the required (k,n)-ring signature. This construction is useful in, for example, electronic negotiations or games where gradual revelation on how many people signed a given document is required. It also provides flexibility of the threshold k. The threshold-flexibility means that, in our scheme, we can change a (k,n)-ring signature into a (k′,n)-ring signature for any k′ ≤ n without revoking the original (k,n)-ring signature. This is useful for signers to withdraw their signatures afterward and/or is useful for new signers to add their (partial of the ring) signatures into the original ring signature. In addition, when k′ < k, this modification requires no extra computation. The security of the proposed scheme is proved in the random oracle model based on the hardness of the discrete logarithm problem and the intractability of inverting cryptographic one-way hash functions. © 2010 Springer-Verlag. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
| dc.subject (關鍵詞) | Design and analysis; Discrete logarithm problems; DL problem; Electronic Negotiations; Extra computations; K-out-of-n; One way hash functions; Random Oracle model; Ring signatures; Threshold ring signatures; threshold-flexibility; Algebra; Hash functions; Network security; Authentication | |
| dc.title (題名) | Design and analysis of "flexible" k-out-of-n signatures | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1007/978-3-642-16576-4_19 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/978-3-642-16576-4_19 | |
