Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工程科學及海洋工程學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/86548
Full metadata record
???org.dspace.app.webui.jsptag.ItemTag.dcfield???ValueLanguage
dc.contributor.advisor張瑞益(Ray-I Chang)
dc.contributor.authorYen-Ting Changen
dc.contributor.author章雁婷zh_TW
dc.date.accessioned2023-03-20T00:02:27Z-
dc.date.copyright2022-08-18
dc.date.issued2022
dc.date.submitted2022-08-11
dc.identifier.citation[1] 'Statista,' 11/21, 2021; https://www.statista.com/ [2] 'Snowflake,' 11, 2021; https://www.snowflake.com/data-marketplace/ [3] 'Datarade,' 11/22, 2021; https://datarade.ai/. [4] 'Alibaba Cloud Machine Learning Platform for AI,' 11/22, 2021; https://www.alibabacloud.com/tc/product/machine-learning. [5] 'AWS Machine Learning,' 11/22, 2021; https://aws.amazon.com/tw/machine-learning/. [6] 'Microsoft Azure AI,' 11/22, 2021; https://azure.microsoft.com/zh-tw/overview/ai-platform/. [7] 'Google Cloud AI,' 11/22, 2021; https://cloud.google.com/products/ai. [8] L. Brandeis, and S. Warren, “The right to privacy,” Harvard law review, vol. 4, no. 5, pp. 193-220, 1890. [9] R. H. Coase, 'The problem of social cost,' Classic papers in natural resource economics, pp. 87-137: Springer, 1960. [10] A. F. Westin, “Privacy and freedom,” Washington and Lee Law Review, vol. 25, no. 1, pp. 166, 1968. [11] R. Gavison, “Privacy and the Limits of Law,” The Yale law journal, vol. 89, no. 3, pp. 421-471, 1980. [12] E. Van Den Haag, 'On privacy,' Privacy & Personality, pp. 149-168: Routledge, 2017. [13] X. Yi, R. Paulet, and E. Bertino, 'Homomorphic encryption,' Homomorphic encryption and applications, pp. 27-46: Springer, 2014. [14] Z. Brakerski, and V. Vaikuntanathan, 'Fully homomorphic encryption from ring-LWE and security for key dependent messages.' pp. 505-524. [15] Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” ACM Transactions on Computation Theory (TOCT), vol. 6, no. 3, pp. 1-36, 2014. [16] A. Acar et al., “A survey on homomorphic encryption schemes: Theory and implementation,” ACM Computing Surveys (CSUR), vol. 51, no. 4, pp. 1-35, 2018. [17] J. Kim, S. Kim, and J. H. Seo, “A new scale-invariant homomorphic encryption scheme,” Information Sciences, vol. 422, pp. 177-187, 2018. [18] K. C. Laudon, Dossier society: Value choices in the design of national information systems: Columbia University Press, 1986. [19] Z. Brakerski, 'Fully homomorphic encryption without modulus switching from classical GapSVP.' pp. 868-886. [20] J. Fan, and F. Vercauteren, “Somewhat practical fully homomorphic encryption,” IACR Cryptol. ePrint Arch., vol. 2012, pp. 144, 2012. [21] J. H. Cheon et al., 'Homomorphic encryption for arithmetic of approximate numbers.' pp. 409-437. [22] I. Chillotti et al., 'Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds.' pp. 3-33. [23] I. Chillotti et al., 'Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE.' pp. 377-408. [24] I. Chillotti et al., “TFHE: fast fully homomorphic encryption over the torus,” Journal of Cryptology, vol. 33, no. 1, pp. 34-91, 2020. [25] P.-E. Clet, O. Stan, and M. Zuber, 'BFV, CKKS, TFHE: Which One is the Best for a Secure Neural Network Evaluation in the Cloud?.' pp. 279-300. [26] W. Wu et al., “Secure and efficient outsourced k-means clustering using fully homomorphic encryption with ciphertext packing technique,” IEEE Transactions on Knowledge and Data Engineering, 2020. [27] D. Liu, E. Bertino, and X. Yi, 'Privacy of outsourced k-means clustering.' pp. 123-134. [28] N. Almutairi, F. Coenen, and K. Dures, 'K-means clustering using homomorphic encryption and an updatable distance matrix: secure third party data clustering with limited data owner interaction.' pp. 274-285. [29] Y. Wang, “Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping,” IACR Cryptol. ePrint Arch., vol. 2015, pp. 519, 2015. [30] Y. Huang, Q. Lu, and Y. Xiong, “Collaborative outsourced data mining for secure cloud computing,” Journal of Networks, vol. 9, no. 10, pp. 2655, 2014. [31] W. K. Wong et al., “Secure kNN computation on encrypted databases,” in Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, Providence, Rhode Island, USA, 2009, pp. 139–152. [32] K.-P. Lin, “Privacy-preserving kernel k-means clustering outsourcing with random transformation,” Knowledge and Information Systems, vol. 49, no. 3, pp. 885-908, 2016. [33] F.-Y. Rao et al., 'Privacy-preserving and outsourced multi-user k-means clustering.' pp. 80-89. [34] H. Rong et al., “Privacy-Preserving-Means Clustering under Multiowner Setting in Distributed Cloud Environments,” Security and Communication Networks, vol. 2017, 2017. [35] A. Alabdulatif et al., “Privacy-preserving data clustering in cloud computing based on fully homomorphic encryption,” 2017. [36] S. Panda, 'Principal Component Analysis Using CKKS Homomorphic Scheme,' Cyber Security Cryptography and Machine Learning. pp. 52-70. [37] J. Liu et al., “Secure KNN Classification Scheme Based on Homomorphic Encryption for Cyberspace,” Security and Communication Networks, vol. 2021, 2021. [38] S. Lloyd, “Least squares quantization in PCM,” IEEE transactions on information theory, vol. 28, no. 2, pp. 129-137, 1982. [39] B. K. Samanthula, Y. Elmehdwi, and W. Jiang, “K-nearest neighbor classification over semantically secure encrypted relational data,” IEEE transactions on Knowledge and data engineering, vol. 27, no. 5, pp. 1261-1273, 2014. [40] H. Rong et al., “Privacy-preserving k-nearest neighbor computation in multiple cloud environments,” IEEE Access, vol. 4, pp. 9589-9603, 2016. [41] W. Wu et al., “Efficient k-Nearest Neighbor Classification Over Semantically Secure Hybrid Encrypted Cloud Database,” IEEE access : practical innovations, open solutions., vol. 6, pp. 41771-41784, 2018. [42] 'TenSEAL,' https://github.com/OpenMined/TenSEAL. [43] 'Kaggle Customer Data,' https://www.kaggle.com/shrutimechlearn/customer-data/version/1. [44] R. Rajalaxmi, and A. Natarajan, “An Effective Data Transformation Approach for Privacy Preserving Clustering 1,” 2008. [45] Y. K. Jain, and S. K. Bhandare, “Min max normalization based data perturbation method for privacy protection,” International Journal of Computer & Communication Technology, vol. 2, no. 8, pp. 45-50, 2011. [46] C. Saranya, and G. Manikandan, “A study on normalization techniques for privacy preserving data mining,” International Journal of Engineering and Technology (IJET), vol. 5, no. 3, pp. 2701-2704, 2013.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/86548-
dc.description.abstract在機器學習 (Machine Learning, ML) 時代,人們越來越關注巨量資料在提高分析、模擬、預測和決策效率方面的經濟價值,以至於資料交易市場興起。由於 ML 需要高運算複雜度的處理過程,個人和企業傾向將雲端運算與資料市場結合使用,但眾所周知,這樣的平台在隱私保護方面存在著資料安全問題。雲端運算中最現代的隱私保護方法是全同態加密 (Fully Homomorphic Encryption, FHE)。然而,高計算成本使得傳統的 FHE 不適用於實際應用。儘管許多研究人員使用 CKKS FHE 來解決這個問題,但本研究實驗發現 CKKS FHE 中一些運算子的計算成本仍舊很高,因此本研究提出了新的安全協議來設計一種新的資料打包方法且減少使用耗時的運算子,並對本研究提出的新的安全協議外包 K-means 分群方法進行實驗與評估。結果顯示本研究方法比 SEOKC (Safe and Efficient Outsourced K-means Clustering)的分群速度更快。使用本研究的資料打包方法可以在高維度資料中獲致良好的分析效能。zh_TW
dc.description.abstractIn the machine learning (ML) era, people are paying more and more attention to the economic value of data in improving the efficiency of analysis, simulation, calculation, forecasting, and decision-making. It results in the rise of data markets. As ML requires high-complexity calculations, individuals and companies tend to use cloud computing with data markets. However, this platform is known to have data security issues in privacy protection. The most modern method for privacy protection in cloud computing is fully homomorphic encryption (FHE). However, the high calculation cost makes conventional FHE impractical for real-world applications. Although many researchers use CKKS FHE to resolve this problem, our experiments show that the calculation cost of some operators in CKKS FHE are still very high. In this paper, we propose new security protocols to design a new data packing method and to reduce the usage of time-consuming calculations. Then, an outsourced K-means clustering method based on these new security protocols is proposed for demonstration and evaluation. Experimental results show that our method is faster than SEOKC (Safe and Efficient Outsourced K-means Clustering). It has shown good performance in high-dimensional data analysis with our new data packing method.en
dc.description.provenanceMade available in DSpace on 2023-03-20T00:02:27Z (GMT). No. of bitstreams: 1
U0001-1008202214193300.pdf: 5295670 bytes, checksum: 72305ac33528bf4789562c38ba27e2bb (MD5)
Previous issue date: 2022
en
dc.description.tableofcontents口試委員會審定書 i 誌謝 ii 中文摘要 iii ABSTRACT iv 圖目錄 vii 表目錄 x 第一章 簡介 1 1.1 研究背景及動機 1 1.2 研究貢獻 4 1.3 論文架構 5 第二章 文獻探討 6 第三章 相關技術 14 3.1 CKKS FHE 14 3.2 K-means 分群 17 第四章 研究方法 19 4.1 LiteSEOKC:減少 SEOKC 中耗時的運算 19 4.2 RP-OKC 27 4.2.1 資料加密 29 4.2.2 找該點所屬群集 30 4.2.3 運算點與各群集中心距離 31 4.2.4 更新群集中心 33 4.2.5 檢查終止條件 35 4.2.6 在最終的群集中心添加雜訊 36 4.2.7 解密最終的群集中心 36 4.2.8 RP-OKC 中應用的方法 37 4.3 SEOKC、LiteSEOKC 和 RP-OKC 安全協議的分工 39 第五章 RP-OKC 安全性分析 40 第六章 實驗結果與分析 43 6.1 SEOKC 和 LiteSEOKC 的計算成本比較 43 6.2 基於記錄打包的各種計算成本分析 44 6.3 RP-OKC 準確度測試 48 6.4 SEOKC、LiteSEOKC 和 RP-OKC 計算成本分析和比較 49 第七章 結論與未來展望 51 參考文獻 52
dc.language.isozh-TW
dc.subjectK-meanszh_TW
dc.subject隱私保護zh_TW
dc.subject全同態加密zh_TW
dc.subject高維度資料分析zh_TW
dc.subject雲端運算zh_TW
dc.subjectK-meanszh_TW
dc.subject隱私保護zh_TW
dc.subject高維度資料分析zh_TW
dc.subject全同態加密zh_TW
dc.subject雲端運算zh_TW
dc.subjecthigh-dimensional data analysisen
dc.subjectPrivacy protectionen
dc.subjectK-means clusteringen
dc.subjectcloud computingen
dc.subjectfully homomorphic encryptionen
dc.subjectPrivacy protectionen
dc.subjectK-means clusteringen
dc.subjectcloud computingen
dc.subjecthigh-dimensional data analysisen
dc.subjectfully homomorphic encryptionen
dc.title基於同態加密的機器學習即服務的雲端外包--以 K-means 分群為例zh_TW
dc.titleOutsourced K-means Clustering for MLaaS based on Homomorphic Encryptionen
dc.typeThesis
dc.date.schoolyear110-2
dc.description.degree碩士
dc.contributor.oralexamcommittee張恆華(Herng-Hua Chang),王家輝(Chia-Hui Wang)
dc.subject.keyword隱私保護,K-means,雲端運算,高維度資料分析,全同態加密,zh_TW
dc.subject.keywordPrivacy protection,K-means clustering,cloud computing,high-dimensional data analysis,fully homomorphic encryption,en
dc.relation.page54
dc.identifier.doi10.6342/NTU202202256
dc.rights.note同意授權(全球公開)
dc.date.accepted2022-08-12
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工程科學及海洋工程學研究所zh_TW
dc.date.embargo-lift2022-08-18-
Appears in Collections:工程科學及海洋工程學系

Files in This Item:
File SizeFormat 
U0001-1008202214193300.pdf5.17 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved