允許否定條件之隱藏式存取控制

A Hidden Access Control Scheme Allowing Negative Constraints

蕭旭君(Hsu-Chun Hsiao)

指導教授 ： 雷欽隆

國立臺灣大學/電機資訊學院/電機工程學研究所/碩士(2008年)

https://doi.org/10.6342/NTU.2008.03018

摘要

現今的網路環境中，越來越多網路使用者存取儲存在第三方檔案伺服器的資料。在此情況下，除了維持資料的隱密性，保護存取權限和政策的隱私性也相當重要。針對此問題，以往的研究者提出了隱藏式憑證和隱藏式政策分別用於隱藏使用者的存取權限和資料提供者的存取政策。然而若要同時達成此兩者，以往的研究必須仰賴可信賴的仲裁者或是需要使用者和資料提供者之間進行多回合的信任協商。在此論文中，我們提出了一個新的密碼系統，將存取權限隱藏於密文之內，只有符合條件的使用者能成功地解回原文件。我們的系統能在單次的加密解密程序間，同時隱藏使用者屬性和資料提供者指定的存取政策，且不需要可信賴的仲裁者。除此之外，我們的機制更允許資料提供者於存取政策內設定否定的條件。最後，我們使用PBC 函式庫實作了此系統，並討論其於各種情境下之效能。

關鍵字

隱藏政策 ； 否定條件 ； 存取控制

並列摘要

In today's open environment, increasing numbers of network users access data stored in third-parties such as file servers on the Internet. Preserving data con dentiality is
important; however, preserving privacy of access right and policy is imperative when the right and policy are as con dential as the data itself. To address this problem,
previous researchers have proposed concepts of hidden credential and hidden policy to hide user's access privileges and content provider's policies respectively. To achieve both features simultaneously, other researchers either rely on a trusted mediator or require multiple rounds of online trust negotiations between two parties. In this paper, we present a novel cryptosystem which hides access policies in ciphertext and allows only users with satis ed attributes to retrieve corresponding plaintext successfully. By using our technique, both attributes and access policies can be kept secret through an o ine encrypt-decrypt process; furthermore, the trust dependency is reduced since no trusted mediator is required. Besides, our construction permits access policies constituted of both positive and negative attributes. Finally, we implement our method using Pairing-based Cryptography (PBC) Library, and discuss its performance under various contexts.

並列關鍵字

Hidden Policies ； Negative Contraints ； Access Control

參考文獻

[11] Melissa Chase. Multi-authority attribute based encryption. In TCC, pages 515-534, 2007.

[1] Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, and Haixia Shi.

Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. In CRYPTO, pages 205-222, 2005.

[2] Giuseppe Ateniese, Marina Blanton, and Jonathan Kirsch. Secret handshakes with dynamic and fuzzy matching. In NDSS, 2007.

[3] Dirk Balfanz, Glenn Durfee, Narendar Shankar, Diana K. Smetters, Jessica Staddon, and Hao-Chi Wong. Secret handshakes from pairing-based key agreements.