完整後設資料紀錄
DC 欄位語言
dc.contributor.author林孝盈en_US
dc.contributor.authorHsiao-Ying Linen_US
dc.contributor.author曾文貴en_US
dc.contributor.authorWen-Guey Tzengen_US
dc.date.accessioned2014-12-12T02:46:03Z-
dc.date.available2014-12-12T02:46:03Z-
dc.date.issued2004en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009223594en_US
dc.identifier.urihttp://hdl.handle.net/11536/76645-
dc.description.abstract我們提出了一個可以秘密計算富翁問題的協定, 而這個協定可以在semi-honest 假設下被證明是安全的。我們的協定可以透過加法或者乘法的同代像加密法(homomorphic encryption schemes)來建構。在以前提出的協定中,都是以加法或者XOR特性的同代像加密法來建構。在計算量與傳輸量上, 我們的協定與之前的協定是在同樣的漸近等級(asymptotic order)。然而因為乘法同代像加密法在實作上比加法同代像加密法來得有效率, 使得我們的協定在實作上可以保有這樣的優點。zh_TW
dc.description.abstractWe proposed a two-round protocol for solving the Millionaires' Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic order as those of the other efficient protocols. Nevertheless, since multiplicative homomorphic encryption scheme is more efficient than an additive one practically, our construction saves computation time and communication bandwidth in practicality.en_US
dc.language.isoen_USen_US
dc.subject秘密計算zh_TW
dc.subject大於問題zh_TW
dc.subject富翁問題zh_TW
dc.subject同代像加密法zh_TW
dc.subjectsecure computationen_US
dc.subjectthe greater than problemen_US
dc.subjectthe socialist millionaires' problemen_US
dc.subjecthomomorphic encryption schemesen_US
dc.title基於同代像加密法秘密計算富翁問題zh_TW
dc.titleAn efficient solution to the Millionaires problem based on Homomorphic encryptionsen_US
dc.typeThesisen_US
dc.contributor.department資訊科學與工程研究所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 359401.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。