Design and analysis of a secure two-phase locking protocol

Abstract

In addition to maintaining consistency of the database, secure concurrency control algorithms must be free from covert channels arising due to data conflicts between transactions. The existing secure concurrency control approaches are unfair to transactions at higher access classes. A secure two-phase locking protocol is presented, which is correct and free from covert channels. The protocol uses three different types of locks to support non-interference property and to provide reasonably fair execution of all transactions, regardless of their access class. The results of a performance evaluation of the protocol are provided, comparing it with secure optimistic concurrency control and secure multiversion timestamp ordering.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>