Demo Data from EDBT 2026 / reviewers in the wild / expert
John C. Wray
dblp:58/3891
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 3 first-author
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.
| Network and information security
2 papers |
Network security · 71% Systems and software security · 29% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security
covert channel |
0.0 | 1 | 1991 | An Analysis of Covert Timing Channels · S&P 1991 |
Network security › covert channel
covert channel analysis |
0.0 | 1 | 1991 | Storage Channels in Disk Arm Optimization · S&P 1991 |
Network security › covert channel
covert timing channel |
0.0 | 1 | 1991 | An Analysis of Covert Timing Channels · S&P 1991 |
Systems and software security
operating system security |
0.0 | 2 | 1991 | An Analysis of Covert Timing Channels · S&P 1991 Storage Channels in Disk Arm Optimization · S&P 1991 |
Systems and software security › operating system security
security kernel |
0.0 | 1 | 1991 | Storage Channels in Disk Arm Optimization · S&P 1991 |
Systems and software security › virtualization security
virtual machine monitor |
0.0 | 1 | 1991 | An Analysis of Covert Timing Channels · S&P 1991 |
Storage systems › i/o scheduling
disk scheduling |
0.0 | 1 | 1991 | Storage Channels in Disk Arm Optimization · S&P 1991 |
Methods — techniques the papers use, named apart from their topics
covert channel analysis · 0.0shared resource matrix methodology · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | An Analysis of Covert Timing ChannelsabstractCovert channels have traditionally been categorized as either storage channels or timing channels [8, 9]. This paper questions this categorization, and discusses channels that cannot be clearly identified as either storage or timing channels, but have aspects of both. A new model of timing channels is presented, which allows for channels that have characteristics of both storage channels and timing channels, and a method is given for constructing all channels in a computer system that have timing channel characteristics. Since Kemmerer's shared resource matrix methodology [7] has the potential to detect all channels that have storage characteristics, it is argued that the two methods jointly have the capability to construct all channels in a computer system. The approach to timing channels provides a justification of specific mechanisms for reducing their bandwidth which were employed in the VAX11VAX is a trademark of Digital Equipment Corporation. Virtual Machine Monitor, as described in [4] and [5]. John C. Wray |
J. Comput. Secur. | 1 |
| 1991 | Storage Channels in Disk Arm OptimizationabstractThe covert storage channels found in disk I/O optimization schemes are studied. The authors examine the source of the problems in the context of various disk architectures, propose several classes of generic solutions and conclude with recommendations for future storage-system architectures. The work was done as part of the covert channel analysis for Digital's VAX security kernel.> Paul A. Karger, John C. Wray |
S&P | 2 |
| 1991 | An Analysis of Covert Timing ChannelsabstractCovert channels have traditionally been categorized as either storage channels or timing channels. The author questions this categorization, and discusses channels that cannot be clearly identified as either storage or timing channels, but have aspects of both. A new model of timing channels is presented, which allows for channels that have characteristics of both storage channels and timing channels, and a method is given for constructing all channels in a computer system that have timing channel characteristics. Since R.A. Kemmerer's (1982) shared resource matrix methodology has the potential to detect all channels that have storage characteristics, the two methods jointly have the capability to construct all channels in a computer system. The approach to timing channels provides a justification of specific mechanisms for reducing their bandwidth which were employed in the VAX Virtual Machine Monitor.> John C. Wray |
S&P | 1 |
| 1989 | An Optimization for Information Flow AnalysisabstractVarious optimizations have been suggested for reducing formal flow violations produced by a standard information flow security analysis for the certification of programs or specifications of computer systems. These optimizations are specific to particular source language constructions and rely on the analysis tool recognizing these constructions through syntactic processing in order that the optimization(s) might be applied. A new optimization for eliminating formal flow violations, suggested by the semantics of the text under analysis, is presented. It is shown that the syntactic optimizations mentioned above can be viewed as special cases of the generalized optimization.> John C. Wray |
CSFW | 1 |