請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/74458
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 吳家麟(Ja-Ling Wu) | |
dc.contributor.author | Pin-Chun Chen | en |
dc.contributor.author | 陳品君 | zh_TW |
dc.date.accessioned | 2021-06-17T08:36:55Z | - |
dc.date.available | 2019-08-19 | |
dc.date.copyright | 2019-08-19 | |
dc.date.issued | 2019 | |
dc.date.submitted | 2019-08-10 | |
dc.identifier.citation | [1] SatoshiNakamoto.Bitcoin:APeer-to-PeerElectronicCashSystem(HP).Consulted, 2008.
[2] Vitalik Buterin. a Next Generation Smart Contract & Decentralized Application Platform. (January):1–36, 2009. [3] S Goldwasser, S Micali, and C Rackoff. The knowledge complexity of interactive proof-systems. Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85, pages 291–304, 1985. [4] Eli Ben-Sasson Technion Alessandro Chiesa, Eran Tromer, and Madars Virza MIT. [zk-Snarks] Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. pages 1–37, 2019. [5] DanBonehandMatthewFranklin.Identity-BasedEncryptionfromtheWeilPairing. SIAM Journal on Computing, 2003. [6] Ian Miers, Christina Garman, Matthew Green, and Aviel D. Rubin. Zerocoin: Anonymous distributed e-cash from bitcoin. Proceedings - IEEE Symposium on Security and Privacy, pages 397–411, 2013. [7] Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. Zerocash: Decentralized anonymous payments from bitcoin. Proceedings - IEEE Symposium on Security and Privacy, pages 459– 474, 2014. [8] Jacob Eberhardt and Stefan Tai. ZoKrates-Scalable Privacy-Preserving Off-Chain Computations. 2018. [9] Scipr-lab.libsnarkperformanceinformationforpreprocessingzk-SNARKforR1CS relation. https://github.com/scipr-lab/libsnark/tree/ master/libsnark/zk proof sys- tems/ppzksnark. accessed: 2018-03-11. [10] D.Genkin S. Kfir E. Tromer E.Ben-Sasson, A. Chiesa and M. Virza. libsnark. 2014. [11] Andrew Chi-Chih Yao. How to generate and exchange secrets. 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), (1):162–167, 2008. [12] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of 19th Annual Symposium on Theory of Computing STOC87, 1987. [13] Andrew C. Yao. Protocols for Secure Computations (Extended Abstract). In FOCS ’82, 1982. [14] Assaf Ben-David, Noam Nisan, and Benny Pinkas. FairplayMP: A System for Secure Multi-Party Computation. Acm Ccs 2008, pages 257–266, 2008. [15] Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, and Łukasz Mazurek. Secure multiparty computations on Bitcoin. Proceedings - IEEE Symposium on Security and Privacy, pages 443–458, 2014. [16] Dan Boneh and Moni Naor. Timed Commitments. (3):236–254, 2000. [17] Juan A.GarayandMarkusJakobsson.TimedReleaseofStandardDigitalSignatures. pages 168–182, 2003. [18] H Shrobe, D L Shrier, and A Pentland. CHAPTER 15 Enigma: Decentralized Computation Platform with Guaranteed Privacy. In New Solutions for Cybersecurity. 2018. [19] Adi Shamir. How to share a secret. Algorithms Unplugged, 1979. [20] RonaldLRivest, Michael L Dertouzos, and Len Adleman.Ondatabanksandprivacy homomorphisms. Foundations of secure computation, 1978. [21] R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 1978. [22] Shafi Goldwasser and Silvio Micali. Probabilistic encryption & how to play mental poker keeping secret all partial information. pages 365–377, 2003. [23] Josh Daniel, Cohen Benaloh, and Josh Daniel Cohen Benaloh. Verifiable Secret- ballot Elections. 1987. [24] David Naccache and Jacques Stern. A new cryptosystem based on higher residues. Proceedings of the 5th ACM conference on on computer and communication security, 1998. [25] Tatsuaki Okamoto and Shigenori Uchiyama. A new public-key cryptosystem as secure as factoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1998. [26] Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. BT - Advances in Cryptology - EUROCRYPT ’99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding. pages 223–238, 1999. [27] Ivan Damgård and Mads Jurik. A length-flexible threshold cryptosystem with applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2727 LNCS(March):350– 364, 2003. [28] Akinori Kawachi, Keisuke Tanaka, and Keita Xagawa. Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography –PKC 2007, pages 315–329, 2007. [29] Taher ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1985. [30] T. Sander and A. Young. Non-interactive cryptocomputing for NC1. Proc. IEEE FOCS, 1999. [31] DanBoneh,Eu-JinGoh,andKobbiNissim.Evaluating2-DNFFormulasonCipher- texts. pages 325–341, 2010. [32] Yuval Ishai and Anat Paskin. Evaluating Branching Programs on Encrypted Data. Theory of Cryptography, pages 575–594, 2007. [33] Craig Gentry. A fully homomorphic encryption scheme. Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC ’09, (Septem- ber):169, 2009. [34] Marten Van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In Proceeding EUROCRYPT’10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, May 30 - June 03, 2010 , French Riviera, France, 2010. [35] Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-LWE and security for key dependent messages. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6841 LNCS:505–524, 2011. [36] Adriana López-Alt, Eran Tromer, and Vinod Vaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. page 1219, 2012. [37] William Vickrey. American Finance Association Counterspeculation , Auctions , and Competitive Sealed Tenders Author ( s ): William Vickrey Source : The Journal ofFinance,Vol.16,No.1(Mar.,1961),pp.8-37Publishedby: Wileyforthe American Finance Associat. 16(1):8–37, 1961. [38] Ahmed Kosba, Andrew Miller, Elaine Shi, Zikai Wen, and Charalampos Papaman- thou. Hawk for Ethereum. [39] Adam Hahn, Rajveer Singh, Chen Ching Liu, and Sijie Chen. Smart contract-based campus demonstration of decentralized transactive energy auctions. 2017 IEEE Power and Energy Society Innovative Smart Grid Technologies Conference, ISGT 2017, 2017. [40] ErikOliverBlassandFlorianKerschbaum.Strain: A secure auction for blockchains. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11098 LNCS:87–110, 2018. [41] David Cerezo Sánchez. Raziel: Private and Verifiable Smart Contracts on Blockchains. pages 1–58, 2018. [42] Hisham S.GalalandAmrM.Youssef.Verifiable sealed-bid auction on the ethereum blockchain. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10958 LNCS:265– 278, 2019. [43] Chris Peikert. A Decade of Lattice Cryptography. Foundations and Trends® in Theoretical Computer Science, 10(4):283–424, 2016. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/74458 | - |
dc.description.abstract | 因為不用第三方的操作與控制,區塊鏈提供了一個非常值得信賴的環境供使用者在上面執行程式。也因此,許多的相關應用應運而生,舉凡電子投票系統、拍賣系統、互聯網等等。然而,區塊鏈「透明化」的性質使得使用者們可以查看到所有放置在區塊鏈上的資料,這也導致了隱私問題。這個問題的存在,也使得目前眾多包含了隱私資訊的應用受到了極大的阻礙。
此篇論文中,我們提供了一個結合了區塊鏈與全同態加密技術的系統,讓我們可以在享有區塊鏈好處的同時,也透過全同態加密保障了隱私安全。藉由我們這個系統,使用者可以輕鬆的強化所寫的智能合約上的隱私保護。使用者透過鏈下加密後,上鏈時只要呼叫全同態加密的函數,便可以在加密空間下進行運算,並通過所有區塊鏈結點的驗證來保障安全性。 最後,我們也設計了維克里拍賣在我們的系統上,通過實際的運作來強調出此系統的優勢與弱點。 | zh_TW |
dc.description.abstract | Without the requirement of trusted third-parties, Blockchain guarantees an environment which can be trusted to everyone. However, the transparency property caused a hazard to real-world application that every on-chain information can be viewed by every user. That is to say, the application which contains sensitive data and personal information which require privacy protection cannot be implemented into Blockchain.
We propose Fully Homomorphic Encryption scheme into Blockchain, combining the trusty and privacy protection, build up a new framework to obtain both of the advantages and make the Blockchain applications easier to enforce privacy protection based on our system. Our framework’s programmer can encrypt the private data off-chain by FHE scheme, sequentially, they can call FHE function to compute their data after their smart contracts deploy to Blockchain. To present the advantages and the weakness of our framework, we then design a Vickrey Auction System using our FHE-based system to make the bidding price in secret while output the winner and his/her required payment. | en |
dc.description.provenance | Made available in DSpace on 2021-06-17T08:36:55Z (GMT). No. of bitstreams: 1 ntu-108-R06944025-1.pdf: 1004217 bytes, checksum: d26602b2b77124357ac3c30b44ca41cd (MD5) Previous issue date: 2019 | en |
dc.description.tableofcontents | 誌謝 ii
摘要 iii Abstract iv 1 Introduction 1 2 Related Work 3 2.1 Blockchain ................................. 3 2.1.1 Decentralization .......................... 4 2.1.2 Transparency ............................ 4 2.1.3 Independence............................ 4 2.1.4 Tamper-proof............................ 4 2.1.5 Reliable............................... 5 2.2 Survey of Related Security Issues and Terminologies . . . . . . . . . . . 5 2.2.1 IntegrationwithZero-knowledge proof . . . . . . . . . . . . . . 5 2.2.2 SecureMulti-PartyComputation.................. 10 2.2.3 HomomorphicEncryption ..................... 12 3 The Blockchain-based Vickrey Auction System 18 3.1 Characteristics of Vickrey Auction and Its Realization via Blockchain ... 19 3.2 IntegratingFHEintoVickreyAuction ................... 21 4 The Proposed Framework 26 4.1 SystemOverview.............................. 26 4.2 SecurityGuarantee ............................. 27 4.3 Our Blockchain-based Implementation of the Vickrey Auction Smart Contract..................................... 28 5 Experimental Results and Performance Evaluation 30 5.1 ThecostofeachFHEoperation ...................... 30 5.2 Gas-spentforVickreyAuction ....................... 32 6 Discussion and Real-world improvement 34 6.1 Contributionsofthiswork ......................... 34 6.2 Real-worldLimitations........................... 35 Bibliography........................... 36 | |
dc.language.iso | en | |
dc.title | 基於理想格的全同態加密技術運用於以太坊區塊鏈上之可行性探討 | zh_TW |
dc.title | A Study of the Applicability of Ideal Lattice-Based Fully Homomorphic Encryption Scheme to Ethereum Blockchain | en |
dc.type | Thesis | |
dc.date.schoolyear | 107-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 陳文進,歐陽明 | |
dc.subject.keyword | 全同態加密,以太坊,區塊鏈,維克里拍賣,Solidity,油錢,隱私保護, | zh_TW |
dc.subject.keyword | Fully-Homomorphic Encryption,Ethereum,Blockchain,Vickrey Auction,Solidity,Gas,Privacy Protection, | en |
dc.relation.page | 40 | |
dc.identifier.doi | 10.6342/NTU201902808 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2019-08-10 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊網路與多媒體研究所 | zh_TW |
顯示於系所單位: | 資訊網路與多媒體研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-108-1.pdf 目前未授權公開取用 | 980.68 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。