資訊安全中,針對安全多方計算的問題已經發展了許多解法。其中一派以計
算上安全(Computationally Secure)出發,嘗試對安全計算提出通用性(general)的解
法 , 但 是 這 類 作 法 需 要 的 效 能 甚 鉅 。 另 外 一 派 是 以 資 訊 上 安 全 (Information
-theoretically Secure)為前提,透過可信任的第三者公正伺服器來提供亂數資料輔
助實際運作的兩方計算,這個方法雖然需要的效能比前者低,但是擴充成多方計
算會造成設計的複雜度變高,一般實際的安全多方運用不見得需要這麼完整的解
法。
為了進一步推廣安全多方計算的運用,需要一個設計上較簡單,執行效率較
高,在處理常用的安全多方計算時能套用或擴充的模型 (model),我們利用加法分
持的概念設計了一個安全多方應用程式的模型,適合解決保障隱私的選舉投票的
類似問題,並以安全會議排程為例,闡述如何考量安全多方計算的需求來應用這
個模型。 / Secure multiparty computation (SMC) allows several untrusting parties to conduct
certain computations over their private data jointly without compromising their privacy.
Since Yao's pioneer work on secure two-party computation, there have been many
proposals of protocols for specific problems as well as of general approaches for secure
protocol development.
However, those proposals, though general, are all very complex and take a lot of
computation resources, thus making people consider them impractical for real-world
applications. This thesis focuses on a simple approach to secure multiparty computation,
namely additive secret sharing, and presents a framework for developing some
real-world applications using it. We argue that, although this approach can solve only a
limited scope of SMC problems, it is easy to apply and is computationally efficient.
Besides showing some typical examples supported by our framework, we have
developed a secure meeting time scheduler to demonstrate the feasibility of this
approach.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0100753025 |
| Creators | 林子文 |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 中文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0023 seconds