An efficient secure real-time concurrency control protocol

Secure real-time databases must simultaneously satisfy two requirements in guaranteeing data security and minimizing the missing deadlines ratio of transactions. However, these two requirements can conflict with each other and achieve one requirement is to sacrifice the other. This paper presents a secure real-time concurrency control protocol based on optimistic method. The concurrency control protocol incorporates security constraints in a real-time optimistic concurrency control protocol and makes a suitable tradeoff between security and real-time requirements by introducing secure influence factor and real-time influence factor. The experimental results show the concurrency control protocol achieves data security without degrading real-time performance significantly.

[1]  Sang Hyuk Son,et al.  Supporting security requirements in multilevel real-time databases , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[2]  Miron Livny,et al.  On being optimistic about real-time constraints , 1990, PODS '90.

[3]  Jayant R. Haritsa,et al.  Secure transaction processing in firm real-time database systems , 1997, SIGMOD '97.

[4]  Miron Livny,et al.  Data access scheduling in firm real-time database systems , 1992, Real-Time Systems.

[5]  Sang Hyuk Son,et al.  Correction to 'Integrating Security and Real-Time Requirements Using Covert Channel Capacity' , 2000, IEEE Trans. Knowl. Data Eng..

[6]  Lui Sha,et al.  A Real-Time Locking Protocol , 1991, IEEE Trans. Computers.

[7]  Susan V. Vrbsky,et al.  Maintaining security in firm real-time database systems , 1998, Proceedings 14th Annual Computer Security Applications Conference (Cat. No.98EX217).