Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Craig Chaney

dblp:76/4590 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%
Network and information security
1 paper
Authentication and access control · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
real-time transaction processing
0.011998
Partial Security Policies to Support Timeliness in Secure Real-Time Databases · S&P 1998
Authentication and access control
security policy
0.011998
Partial Security Policies to Support Timeliness in Secure Real-Time Databases · S&P 1998
Embedded and real-time systems
real-time databases
0.011998
Partial Security Policies to Support Timeliness in Secure Real-Time Databases · S&P 1998

Methods — techniques the papers use, named apart from their topics

requirement specification · 0.1performance comparison · 0.1
YearPublicationVenuePosition
1998 Partial Security Policies to Support Timeliness in Secure Real-Time Databases
abstract
Conflicts in database systems with both real-time and security requirements can be unresolvable. We address this issue by allowing a database system to provide partial security in order to improve real-time performance when necessary. Systems that are partially secure allow potential security violations such as covert channel use in certain situations. We present the idea of requirement specification that enables the system designer to specify important properties of the database at an appropriate level. To help the designer, a tool can process the database specification to find unresolvable conflicts, and to allow the designer to specify the rules to follow during execution when those conflicts arise. We discuss several partial security policies and compare their performance in terms of timeliness and potential security violations.
Sang Hyuk Son, Craig Chaney, Norris P. Thomlinson
S&P2
1997 Supporting the Requirements for Multilevel Secure and Real-Time Databases in Distributed Environments
Sang Hyuk Son, Craig Chaney
DBSec2
1997 Design and Analysis of an Adaptive Policy for Secure Real-Time Locking Protocol
Sang Hyuk Son, Rasikan David, Craig Chaney
Inf. Sci.3