以朋友互動性為基準的金鑰管理方法-用於社群網路

Abstract

在這篇論文中，我們提出了一種新的用於社群網路上的金鑰管理方法，想法是給予互動的使用者更高的權限來看更隱私的文章。這個金鑰管理方法不僅能讓使用者能有權限看他有興趣的文章和降低那些使用者沒興趣的文章被看到的機會，還可以動態的調整群組成員使得與互動的使用者更靠近。我們建立一個存取圖，這個存取圖內有三個偏序關係的類別(1)最靠近的 (2)志同道合的 (3)熟識的。舉例來說，使用者在熟識的類別裡無法看到那些張貼在志同道合類別裡的文章；但是使用者在志同道合的類別裡面不僅僅可以看到志同道合類別裡的文章還可以看到熟識的類別裡的文章。這篇論文的目標是建立一個金鑰管理方法讓使用者控制他們要張貼的文章是要分寫給哪一種等級的類別，並且無須依靠可信任的第三方來管理文章該給誰看。這邊考慮的存取控制是使用者列出的存取規則是基於社群網路上文章的隱私重要性來決定的；舉例來說，有些文章只能給熟識的類別看，然而有些文章是能給志同道合的類別能看。這種存取控制機制是透過Shamir’s的秘密分享方法來做金鑰管理。換句話說就是使用者是透過互動的多與寡來決定是否能夠得到密鑰。我們提出的方法有下些特性: (1)在硬碟和推出金鑰時間的負擔是很小的 (2)具有金鑰恢復安全性 (3)可根據使用著的互動行為來動態調整類別裡的成員到不同的的類別裡面。

In this paper we introduce a novel scheme for key mechanism in social networks. The ideal of this scheme is giving cooperative users more authority to see more private contents. The scheme not only let users see the contents they interest from their point of view and decrease irrelevant contents to others but also dynamically adjust the group members to let the cooperative users close. We create an access graph with three classes i) Closed, ii) Like-minded, iii) Acquaintance which have partial order relation; for example the user in Acquaintance cannot see the contents post to Like-minded but the user in Like-minded can see the contents not only in Like-minded but also in Acquaintance. The goal of this paper is to produce a mechanism through which users can control how their content is shared with which level classes, without relying on a trusted third party to management the users’ content who can see. The specific access control model considered here is that the owner will specify access policies based on the importance of contents in the social network; for example some content is visible to the users in Acquaintance only, while other content is visible to the users in Like-minded, etc. This access control is enforced via key management with Shamir’s secret sharing scheme. That is for each user, there is a key that only friends who recover the key through cooperative behavior should be able to derive. The proposed scheme enjoys the following properties: i) the scheme is efficient in terms of server storage and key derivation time, ii) the scheme is collusion resistant (key recovery security), iii) The scheme can automatically adjust the class members to different classes based on their cooperative behaviors.