請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36874完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 雷欽隆 | |
| dc.contributor.author | Yu-Shian Chen | en |
| dc.contributor.author | 陳煜弦 | zh_TW |
| dc.date.accessioned | 2021-06-13T08:20:24Z | - |
| dc.date.available | 2006-07-26 | |
| dc.date.copyright | 2005-07-26 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-18 | |
| dc.identifier.citation | [JMV 01]D. Johnson, A. Menezes, and S. Vanstone, 'The Elliptic Curve Digital Signature Algorithm (ECDSA),' in International Journal of Information Security, Vol.1 , No. 1, August, 2001
[Sha 79]A. Shamir, 'How to share a secret,' in Communications of the ACM, Vol. 22, 1979, pp. 612-613. [Bla 79]G. R. Blakley, 'Safeguarding cryptographic keys,' in Proceedings AFIPS 1979 Nat. Computer Conf., pp. 313-319, 1979 [Feld 87]P. Feldman, 'A practical scheme for non-interactive verifiable secret sharing,' in Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science, 1987, pp. 427--437. [Ped 98]T. Pedersen, 'Non-interactive and information-theoretic secure verifiable secret sharing,' in Advances in Cryptology -- Crypto'91, LNCS 576, 1992, pp. 129--140. [Ped 97]T. Pedersen, 'A threshold cryptosystem without a trusted party,' in Eurocrypt '91, pp 522-526, 1991 LNCS 547. [BGW 88]M. Ben-Or, S. Goldwasser, A. Wigderson, 'complete theorems for non-cryptograhpic fault-tolerant distributed computation,' In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp 1-10, May, 1988. [Bon 01]D. Boneh, and M Franklin, 'Efficient generation of shared RSA keys,' Journal of ACM, 2001 [Tang 02]C Tang, 'ECDKG: A Distributed Key Generation Protocol Based on Elliptic Curve Discrete Logarithm,' in http://www.cs.usc.edu/Research/ReportsList.htm Technical Report 2002. [CD 98]R. Cramer and I. Damgard. Zero-knowledge proofs for finite field arithmetic or: Can zero-knowledge be for free? In Advances in Cryptology--- CRYPTO '98, volume 1462 of Lecture Notes in Computer Science. Springer, 1998. [GRR 98]R. Gennaro, M. Rabin, T. Rabin, 'Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography,' in Proceeding of the 17th Annul ACM Symposium on Principles of Distributed Computing, June, 1998. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36874 | - |
| dc.description.abstract | 橢圓曲線數位簽章演算法 (ECDSA) 是被廣為應用的簽章標準。我們推演出了門檻式的橢圓曲線數位簽章演算法。在我們提出的機制中，原本的 ECDSA 簽署者被分散成 n 個成員的群體。在 t<n/2 的前提下，該群體以秘密分享的方式共享某個橢圓曲線私密金鑰。
簽署一個合法的簽章需要群體中至少 t 個成員，任何少於 t 的共謀將無法偽造簽章也無法獲得其他成員的部分私密金鑰。 即使在某些成員企圖破壞運算過程的情況下，其他的成員可藉著互動式零知識驗證的技巧辨識出欺騙者。我們的機制混合了可驗證秘密分享、零知識與分散式運算的技巧。 | zh_TW |
| dc.description.abstract | ECDSA is a widely adopted standard.
We present a (t,2t,n) threshold Elliptic Curve Digital Signature Algorithm (ECDSA) scheme. In our scheme, the regular ECDSA signer is distributed into a $n$-participant group which shares the elliptic curve private key by Secret Sharing (SS) with the parameter 2t<n. To sign a valid signature with no one's secret revealed, it takes at least 2t participants of the group to collaborate. Coalition of less than t participants can not forge any signature nor require other's partial private keys. Even when some cheaters try to spoil the final result, the other honest participants still can identify them by interactive zero-knowledge proof. Our scheme is composed of verifiable secret sharing, zero knowledge proof and many distributed computation skills. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T08:20:24Z (GMT). No. of bitstreams: 1 ntu-94-R92921096-1.pdf: 289344 bytes, checksum: c4dddbeda54434b91ac89eabece1c35f (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | 1. Introduction---3
2. ECC and ECDSA---6 2.1 Elliptic Curve Cryptosystem---6 2.2 ECDSA---8 3. Preliminaries---10 3.1 Shamir's Secret Sharing---10 3.2 Verifiable Secret Sharing---11 3.3 Distributed Multiplication---12 3.4 Distributed inverse Derivation---15 4. Proposed Threshold ECDSA---17 4.1 System Model---17 4.1.1 Communication Model---17 4.1.2 Adversary Model---17 4.2 Threshold-ECDSA Scheme---18 4.3 Cheater Detection---19 4.4 Discussions---20 4.5 Threshold Level---20 5. Security Analysis---22 5.1 Correctness---22 5.2 View---22 5.3 Unforgeability---23 6. Conclusions---26 Appendix A Pedersen's Distributed Key Generation---29 Appendix B BGW-Method---31 Appendix C Zero-Knowledge Proof for Multiplication---34 | |
| dc.language.iso | en | |
| dc.subject | 門檻式機制 | zh_TW |
| dc.subject | 橢圓曲線數位簽章演算法 | zh_TW |
| dc.subject | 秘密分享 | zh_TW |
| dc.subject | 數位簽章 | zh_TW |
| dc.subject | 多人運算 | zh_TW |
| dc.subject | 零知識驗證 | zh_TW |
| dc.subject | multiparty computation | en |
| dc.subject | secret sharing | en |
| dc.subject | threshold schemes | en |
| dc.subject | ECDSA | en |
| dc.subject | zero-knowledge proof | en |
| dc.subject | digital signatures | en |
| dc.title | 門檻式橢圓曲線數位簽章演算法 | zh_TW |
| dc.title | Threshold Elliptic Curve Digital Signature Algorithm (Threshold ECDA) | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 莊文勝,范俊逸,劉立,黃秋煌 | |
| dc.subject.keyword | 橢圓曲線數位簽章演算法,門檻式機制,秘密分享,數位簽章,多人運算,零知識驗證, | zh_TW |
| dc.subject.keyword | ECDSA,threshold schemes,secret sharing,digital signatures,multiparty computation,zero-knowledge proof, | en |
| dc.relation.page | 35 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2005-07-19 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 未授權公開取用 | 282.56 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。