Demo Data from SIGIR 2026 / reviewers in the wild / expert
Steven J. Greenwald
dblp:90/288
· DBLP profile ↗
10ranked-venue papers
6as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 9 · 6 first-authorTheory of computation · 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.
| Theoretical computer science
2 papers |
Information theory · 76% Coding theory · 24% | |
| Network and information security
2 papers |
Network security · 58% Hardware security and side channels · 42% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
channel capacity |
0.0 | 2 | 1998 | An Analysis of the Timed Z-Channel · IEEE Trans. Inf. Theory 1998 An Analysis of the Timed Z-channel · S&P 1996 |
Network security
covert channel |
0.0 | 2 | 1998 | An Analysis of the Timed Z-channel · S&P 1996 An Analysis of the Timed Z-Channel · IEEE Trans. Inf. Theory 1998 |
Information theory › signal processing › information embedding › information hiding
covert channel |
0.0 | 1 | 1998 | An Analysis of the Timed Z-Channel · IEEE Trans. Inf. Theory 1998 |
Coding theory › channel coding
timing channel |
0.0 | 1 | 1998 | An Analysis of the Timed Z-Channel · IEEE Trans. Inf. Theory 1998 |
Information theory › channel capacity › memoryless channels
z-channel |
0.0 | 1 | 1998 | An Analysis of the Timed Z-Channel · IEEE Trans. Inf. Theory 1998 |
Hardware security and side channels › side-channel attack
timing side channel |
0.0 | 1 | 1996 | An Analysis of the Timed Z-channel · S&P 1996 |
Methods — techniques the papers use, named apart from their topics
characteristic equation · 0.0capacity bounds · 0.0optimization · 0.0algebraic capacity analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Quis Custodiet ipsos Custodes?: a new paradigm for analyzing security paradigms with appreciation to the Roman poet JuvenalabstractDo you believe that more than one single security paradigm exists? We do. Sean Peisert, Matt Bishop, Laura Corriss, Steven J. Greenwald |
NSPW | 4 |
| 2008 | Towards an ethical code for information security?abstractMost computer scientists reflexively reject the idea of a malicious universe due to its conflict with the dominant scientific paradigm of a non-teleological impartially disinterested universe. While computer scientists might not view the universe as benign, neither do they view the universe as actively hostile. In addition, most scientist would take the view that a teleological universe equals paradigmatic heresy. Steven J. Greenwald, Brian D. Snow, Richard Ford, Richard Thieme |
NSPW | 1 |
| 2006 | E-Prime for security: a new security paradigm
Steven J. Greenwald |
NSPW | 1 |
| 2004 | The user non-acceptance paradigm: INFOSEC's dirty little secretabstractThis panel will address users' perceptions and misperceptions of the risk/benefit and benefit/nuisance ratios associated with information security products, and will grope for a solution, based on the psychology of personality trait-factoring results, among other multidisciplinary approaches, to the problem of user non-acceptance of information security products. This problem has acquired a much more scientific guise when amalgamated with the psychology of personality and reinforced by reflections from the field on patterns of user behavior. A gross simplification of the main thrust of the panel is this thesis: if we start profiling the defenders rather than the offenders and do it on the basis of real science rather than very crude personality tests, then we will, at the very least, understand what is happening and possibly create a desirable profile for sysadmins, CIOs, and perhaps even CFOs. This swept-under-the-rug problem is information security's dirty little secret. No other forum is designed to address this, and it may well become yet another major conceptual and paradigmatic shift in the field, of the type initiated in the NSPWs over the last decade. We know that the panel will generate an assured considerable interest among the participants. Steven J. Greenwald, Kenneth G. Olthoff, Victor Raskin, Willibald Ruch |
NSPW | 1 |
| 2002 | Assurance in life/nation critical endeavors a panelabstractOur thesis is that biometric and other intertwined technologies will be used to supplement the work of people in the security field. When these technologies are used, we fear that a high degree of misinterpretation and error is likely. Because of this, we need to identify the technical measures required for these systems. This thesis, along with a justification, and proof sketch, was given to the panelists.Five areas of the technology life-cycle were investigated: modeling, implementation, interpretation of results, database protection, and social issues.The format was simple. After the introduction, each panelist gave a brief presentation. Afterwards the workshop participated in a highly interactive and collegial way, with the panel chair keeping things orderly.A lively discussion resulted, with many good comments and questions from the NSPW attendees, some of which we report. Steven J. Greenwald, Marvin Schaefer |
NSPW | 1 |
| 2001 | The New Security Paradigms Workshop - boom or bust?: a panelabstractHas anything actually been accomplished by the New Security Paradigms Workshop since its inception in 1992? If so, what? This, in a nutshell, was the basis of our panel. We had three high-profile NSPW groupies as panelists: our illustrious founder Hilary Hosmer who gave a passionate ponderment of the past 8 years, a perspective from Mary Ellen Zurko who entered NSPW during the middle of its current lifetime (1996) and has authored many reviews of NSPW for CIPHER, and some punishing comments by Marv Schaefer. I also entered the NSPW community in 1996, and was the panel chair in what was a very interactive panel. We had a view from the early days and a view from the more mature days of the ten year old New Security Paradigms Workshop.What did we find out? Were the past years of NSPW wasted? Or did they result in some of the best ideas to hit the information security field? Or something in between?In either case, where should we go from here?The format of the panel was simple. Each panelist gave a brief presentation with the workshop participating in its usual collegial style, with the panel chair to keep things on track.After the workshop, the original panel charge was revised to reflect and add the comments of the workshop attendees. Steven J. Greenwald |
NSPW | 1 |
| 1998 | Towards Formalizing the Java Security Architecture of JDK 1.2
Lora Kassab, Steven J. Greenwald |
ESORICS | 2 |
| 1998 | An Analysis of the Timed Z-ChannelabstractGolomb analyzed the Z-channel, a memoryless channel with two input symbols and two output symbols, where one of the input symbols is transmitted with noise while the other is transmitted without noise, and the output symbol transmission times are equal. We generalize to the timed Z-channel, where the output symbol transmission times are not equal. The timed Z-channel appears as the basis for a large class of covert (communication) channels appearing in multilevel secure computer systems. We give a detailed mathematical analysis of the timed Z-channel and report a result expressing the capacity of the timed Z-channel as the log of the root of a characteristic equation. This generalizes Shannon's work on noiseless channels for this special case. We also report a new result bounding the timed Z-channel's capacity from below. We show how an interesting observation that Golomb reported for the Z-channel also holds for the timed Z-channel. Ira S. Moskowitz, Steven J. Greenwald, Myong H. Kang |
IEEE Trans. Inf. Theory | 2 |
| 1996 | A new security policy for distributed resource management and access controlabstractThe common security policies of access control and resource management are based upon a central managing authority, called the system administration, that is ultimately responsible for the management of a usage policy.This management is usually done with some combination of mandatory access control and discretionary access control methods, where each user is granted (or denied) privileges and resources depending on the usage policies enforced at that particular system.System administration includes the management of system resources, user accounts, and user privileges.This security policy is typified by an operating system such as UNIX, and it introduces several dificulties when working in a distributed computing environment.This paper addresses distributed resource management and access control.It proposes a new version of the "Distributed Compartment Model" (DChf), first developed by Greenwald in his 1994 doctoral dissertation.DCM consists of two major components: Handles, a method for role based access control, and Distributed Compartments, a method allowing users to manage resources within a distributed system across administrative domain boundaries.This new version of DCM dis-cussed in this paper is a refinement of the original formal security policy model.This paper concentrates on the history and background of the problems motivating the creation of DCM, describes the informal security policy, proposes some ezample scenan'os as to how DCM could be used, and concludes with a discussion of the results of this research. CompartmentModel (DCM) [8, 91 is a new paradigm for the man-'The author is obviously open to suggestions for more appropriate terminology, and is also interested in exactly when JASP first came into existence. Steven J. Greenwald |
NSPW | 1 |
| 1996 | An Analysis of the Timed Z-channelabstractOur timed Z-channel (a general case of the Z-channel) appears as the basis for a large class of covert channels. Golomb (1980) analyzed the Z-channel, a memoryless channel with two input symbols and two output symbols, where one of the input symbols is transmitted with noise while the other is transmitted without noise, and the output symbol transmission times are equal. We introduce the timed Z-channel, where the output symbol transmission times are different. Specifically, we show how the timed Z-channel applies to two examples of covert timing channel scenarios: a CPU scheduler and a token ring network. We then give a detailed analysis of our timed Z-channel. We report a new result expressing the capacity of the timed Z-channel as the log of the root of a trinomial equation. This changes the capacity calculation from an optimization problem into a simpler algebraic problem and illustrates the relationship between the noise and time factors. Further, it generalizes Shannon's (1948, 1949) work on noiseless channels for this special case. We also report a new result bounding the timed Z-channel's capacity from below. Finally, we show how an interesting observation that Golomb reported for the Z-channel also holds for the timed Z-channel. Ira S. Moskowitz, Steven J. Greenwald, Myong H. Kang |
S&P | 2 |