عنوان مقاله

توسعه تکنیک کنترل همروندی برای پایگاههای داده امن چند سطحی



خرید نسخه پاورپوینت این مقاله


خرید نسخه ورد این مقاله



 

فهرست مطالب

مقدمه

مسائل امنیتی

مرور ادبیات

کار پیشنهادی: الگوریتم کنترل همروندی امن بدون گرسنگی

نتیجه گیری





بخشی از مقاله

پایگاههای دادهMLS  براساس مدل امنیتBell-LaPadula  عمل می کنند که دارای خصوصیات زیر می باشند: 

خصوصیت امنیت ساده: این خصوصیت می گوید که فرددر صورتی اجازه دسترسی به خواندن برای یک شی را دارد که سطح کلیرانس فرد شبیه یا بالاتر از سطح طبقه بندی شی باشد. 

خصوصیت ستاره: بر طبق این خصوصیت، فرد تنها در صورتی اجازه دسترسی به نوشتن برروی یک شی را دارد که سطح کلیرانس فرد شبیه به سطح طبقه بندی شی باشد. 






خرید نسخه پاورپوینت این مقاله


خرید نسخه ورد این مقاله



 

کلمات کلیدی: 

Development of a Concurrency Control Technique for Multilevel Secure Databases Pooja Sapra Research Scholar, MRIU mrs.sapra@gmail.com Abstract- Multilevel secure database systems are the systems in which security classifications are assigned from the relations to data elements. Due to security requirements of databases, the concurrency control mechanisms for such databases are different than the concurrency control mechanisms in traditional databases. In this paper, we present a new algorithm for concurrency control that is shown to be starvation-free to some extent. Keywords -multilevel secure databases, concurrency control, covert channeL I. INTRODUCTION As the need of database is increasing, so as the need of securing the data is also increasing. Multilevel secure databases are shared by local databases and users at different sites and the transaction processing takes place at different security levels. So the concurrency requirements include the secure access of data items that are shared by different transactions. These databases are based on the Bell-LaPadula model [17] and consist of a set of subjects, objects, an access control matrix and security levels. Subjects can be user and processes while the objects are the data items or fields on which the access is required. For the information flow it enforces the following two restrictions: simple security restriction and star property restriction. Simple Security Property: A subject can have a read access on an object if the clearance level of the subject is identical to or higher than the classification level of the object. Star Property: A subject can write on an object if clearance level of subject is identical to classification level of the object. Due to these two restrictions on information flow, the transaction can't be executed concurrently with the same mechanism as with traditional mechanisms. Moreover, the present protocols [2, 3,4,5,6, 9, lO, 11, 12] leave the high level secure transaction in a waiting state unless the low level secure transaction commits, it is known as starvation. We therefore present a starvation free concurrency control mechanism for multilevel secure databases that does not suffer from covert channel and retrieval anomaly. The paper is organized as follows: In section 2, we consider the requirements of concurrency control mechanism in secure databases vs. traditional databases. Section 3 is devoted to recent relevant literature. In section 4, we present the proposed algorithm. Section 5 illustrates the performance of the algorithm on securedatabase systems. Finally in section 6, we conclude the 978-1-4799-2995-5/14/$31.00©20 14 IEEE 111 Suresh Kumar FET, MRIU enthuvs@gmai1.com paper with some observation about overheads in secure databases.