Citation graph for Security and Privacy Papers, 1980-2009

This a directed graph of citations of SP papers to SP papers. It is in "scalable vector graphics" format, and should be viewable in most web browsers. This is a very wide graph, and you will probably want to "zoom" in to see the details.

An arrow from A to B means that A cites B.

The label has the year and approximate filename from the "all years" DVD distributed to all SP and CSF attendees in 2009.

If A is not cited, it is a box.

The height of an oval gives a rough indication of its in-degree.

Holding the mouse cursor over a node will pop-up a small label with the title of the paper.

The color is a gradient from red to blue. Red is for the most recent papers, blue is for the oldest papers, purple is for papers midway between.

The data undoubtedly has errors --- a lot of manual labor went into culling the data and using heuristic methods to turn garbage into links.

The big graph

This is a graph of the same data, concentrating more on the outdegree of the nodes (papers that are "magnanimous"). The node colors have the same meaning. However, the boxes are papers that do not cite other papers. Taller ellipses indicate papers that cite more papers. The link color is a gradient showing the number of years between a paper and what it cites. Blue is for a short interval, green is for a longer interval.

This was done with the GraphViz tool "dot". Here's the input file. The "zgrviewer", a Java application that works in conjunction with GraphViz, provides an excellent interface for navigating large svg files.

The Most Influential Oakland Papers

These are the papers most often cited by other Oakland papers:

  • Security Policies and Security Model, 1982
  • Unwinding and Inference Control, 1984
  • Specifications for Multi-Level Security and a Hook-Up Property, 1987
  • A Comparison of Commercial and Military Computer Security Policies, 1987, Citation Evolution
  • Noninterference and the Composability of Security Properties, 1988
  • Information Flow in Nondeterministic Systems, 1990
  • The Chinese Wall Security Policy, 1989
  • Reducing Timing Channels with Fuzzy Time, 1991
  • A Sense of Self for Unix Processes, 1996
  • Reasoning about Belief in Cryptographic Protocols, 1990
  • Decentralized Trust Management, 1996
  • Security Models and Information Flow, 1990
  • A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions, 1994
  • The Use of Logic in the Analysis of Cryptographic Protocols, 1991
  • Access Control Meets Public Key Infrastructure, or: Assigning Roles to Strangers, 2000
  • Non-Discretionary Controls for Commercial Applications, 1985
  • An Augmented Capability Architecture to Support Lattice Security and Traceability of Access, 1984
  • A Multilevel Relational Data Model, 1987
  • Reasoning About Security Models, 1987
  • Covert Channel Capacity, 1987
  • The Typed Access Matrix Model, 1992
  • Detecting Intrusions Using System Calls: Alternative Data Models, 1999
  • A Data Mining Framework for Building Intrusion Detection Models, 1999
  • Using Programmer-Written Compiler Extensions to Catch Security Holes, 2002
  • Intrusion Detection via Static Analysis, 2001
  • Using Mandatory Integrity to Enforce Commercial Security, 1988
  • A Secure Identity-Based Capability System, 1989
  • An Analysis of Covert Timing Channels, 1991
  • A Secure and Reliable Bootstrap Architecture, 1997

The "Gregarious" Oakland Papers

These papers are "gregarious" in that they both cite more than one paper and are themselves cited more than once, and the total of the two is at least 6.

  • Information Flow in Nondeterministic Systems
  • The Use of Logic in the Analysis of Cryptographic Protocols
  • A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions
  • Security Models and Information Flow
  • Practical Domain and Type Enforcement for UNIX
  • Intransitive Non-Interference for Cryptographic Purposes
  • Hardening COTS Software with Generic Software Wrappers
  • Variable Noise Effects Upon a Simple Timing Channel
  • A General Theory of Security Properties
  • Formalizing Sensitivity in Static Analysis for Intrusion Detection
  • Design of a Role-Based Trust-Management Framework
  • Intrusion Detection via Static Analysis
  • LOMAC: Low Water-Mark Integrity Protection for COTS Environments
  • A Secure Identity-Based Capability System
  • An Analysis of Covert Timing Channels
  • The Typed Access Matrix Model
  • Java Security: From HotJava to Netscape and Beyond
  • On the Secrecy of Timing-Based Active Watermarking Trace-Back Techniques
  • Anomaly Detection Using Call Stack Information
  • SD3: A Trust Management System with Certified Evaluation
  • Preserving Information Flow Properties Under Refinement
  • Controlling Logical Inference in Multilevel Database Systems
  • The Algebra of Security
  • Safety Analysis for the Extended Schematic Protection Model
  • A Secure and Reliable Bootstrap Architecture
  • Relating Symbolic and Cryptographic Secrecy
  • Semantics-Aware Malware Detection
  • Views as the Security Objects in a Multilevel Secure Relational Database Management System
  • Multiversion Concurrency Control for Multilevel Secure Database System
  • Some Conundrums Concerning Separation of Duty
  • Probabilistic Interference
  • Exploring the BAN Approach to Protocol Analysis
  • Simple Timing Channels
  • Complete, Safe Information Flow with Decentralized Labels
  • Understanding Java Stack Inspection
  • Exploring Multiple Execution Paths for Malware Analysis
  • A Fast Automaton-Based Method for Detecting Anomalous Program Behaviors
  • IRM Enforcement of Java Stack Inspection
  • Compartmented Mode Workstation: Results Through Prototyping
  • Storage Channels in Disk Arm Optimization
  • A Semantic Model for Authentication Protocols
  • A Logical Language for Specifying Cryptographic Protocol Requirements
  • Prudent Engineering Practice for Cryptographic Protocols
  • Network Version of the Pump
  • A Practically Implementable and Tractable Delegation Logic

Some Statistics

This shows for each five year period, how many papers there were in that period, the total number of authors, the number of papers that cite other Oakland papers, the total number of citations of Oakland papers, and the total number of years "spanned" (i.e., the summation of difference in year published to year cited).\

Years     Papers   Authors  Papers  Total  Total
                            that    cites  years
                            cite           spanned
1980-1985: 101      157      13       22      27
1985-1990: 128      262      47       95     237
1990-1995: 120      242      84      251     838
1995-2000: 115      258      59      187    1137
2000-2005: 102      270      65      169    1171
2005-2009: 132      462      89      205    1270
2010     :  31      121      21       56     380