東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Secure Cooperative Data Access in Mu...

Le, Meixing.

FindBook

Google Book

Amazon

博客來

Secure Cooperative Data Access in Multi-Cloud Environment.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Secure Cooperative Data Access in Multi-Cloud Environment./
作者:	Le, Meixing.
面頁冊數:	127 p.
附註:	Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.
Contained By:	Dissertation Abstracts International74-11B(E).
標題:	Information Technology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3588757
ISBN:	9781303270734

Secure Cooperative Data Access in Multi-Cloud Environment.
Le, Meixing.

Secure Cooperative Data Access in Multi-Cloud Environment. - 127 p.

Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.

Thesis (Ph.D.)--George Mason University, 2013.

In this dissertation, we discuss the problem of enabling cooperative query execution in a multi-cloud environment where the data is owned and managed by multiple enterprises. Each enterprise maintains its own relational database using a private cloud. In order to implement desired business services, parties need to share selected portion of their information with one another. We consider a model with a set of authorization rules over the joins of basic relations, and such rules are defined by these cooperating parties. The accessible information is constrained by these rules. It is assumed that the rest of the information is well protected but those mechanisms are not addressed here.

ISBN: 9781303270734Subjects--Topical Terms:

1030799
Information Technology.

Secure Cooperative Data Access in Multi-Cloud Environment.
LDR:04256nam a2200313 4500 001 1965578
005 20141030134122.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303270734
035 $a (MiAaPQ)AAI3588757
035 $a AAI3588757
040 $a MiAaPQ $c MiAaPQ
100 1 $a Le, Meixing. $3 2102257
245 1 0 $a Secure Cooperative Data Access in Multi-Cloud Environment.
300 $a 127 p.
500 $a Source: Dissertation Abstracts International, Volume: 74-11(E), Section: B.
500 $a Advisers: Sushil Jajodia; Krishna Kant.
502 $a Thesis (Ph.D.)--George Mason University, 2013.
520 $a In this dissertation, we discuss the problem of enabling cooperative query execution in a multi-cloud environment where the data is owned and managed by multiple enterprises. Each enterprise maintains its own relational database using a private cloud. In order to implement desired business services, parties need to share selected portion of their information with one another. We consider a model with a set of authorization rules over the joins of basic relations, and such rules are defined by these cooperating parties. The accessible information is constrained by these rules. It is assumed that the rest of the information is well protected but those mechanisms are not addressed here.
520 $a It is expected that the authorization rules are formulated based on business needs and agreements, and may suffer from several issues. First, the rules may be inconsistent in that they release more information than the parties may realize or agree to. We formalize the notion of consistency of authorization rules and devise an algorithm to augment rules to maintain rule consistency. We also consider the possibility of occasional changes in authorization rules and address the problem of maintaining consistency in the face of such changes. We propose algorithms for both changes with new privileges grants and revocations on existing privileges. Instead of augmentation, conflicts may be resolved by introducing negative rules. We discuss the mechanism to check if the negative rules can be violated and the possible way of enforcing them.
520 $a The second issue is that the parties may possess inadequate access to basic data to implement the operations required for providing the stated access to the composed data. In other words, the rules cannot be enforced or implemented in reality. Therefore, we propose an algorithm to systematically check the enforceability for each given authorization rule in order to determine the set of queries that can be safely executed. We also present mechanisms to generate a query execution plan which is consistent with the authorization rules for each incoming authorized query. Since finding the optimal query plan can be very expensive, our algorithm attempts to find good query plans using a greedy approach. We show that the greedy approach provides plans that are very close to optimal but can be obtained with a far lower cost.
520 $a The third issue to consider is handling of situations where rules cannot be enforced among existing parties. For this, we propose the introduction of trusted third parties to perform the expected operations. Since interactions with the third party can be expensive and there maybe risk of data exposure/misuse, while the data is held by third party, it is important to minimize their use. We define a cost model and formulate the minimization problem. We show that this problem is NP-hard, so we use greedy algorithms to generate solutions. With extensive simulation evaluations, the results show the effectiveness of our approach. Furthermore, we discuss different types of third parties, and the need for multiple third parties. We examine the problem of how to use minimal number of third parties to meet the given security requirements. This problem thus out to be strongly related to the graph coloring problems. We propose some heuristics to find near optimal answers.
590 $a School code: 0883.
650 4 $a Information Technology. $3 1030799
650 4 $a Computer Science. $3 626642
690 $a 0489
690 $a 0984
710 2 $a George Mason University. $b Information Technology. $3 2095426
773 0 $t Dissertation Abstracts International $g 74-11B(E).
790 $a 0883
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3588757