Demo Data from VLDB 2026 / reviewers in the wild / expert
Carl E. Landwehr
dblp:04/4402
· DBLP profile ↗
26ranked-venue papers
17as first author
0since 2021 · last 2017
0000-0002-5824-1697ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 14 · 8 first-authorSoftware engineering, systems software and programming languages · 5 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 3 first-authorSystems, architecture and hardware · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 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
8 papers |
Privacy and data protection · 62% Cryptographic primitives and cryptanalysis · 21% Systems and software security · 10% | |
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Distributed systems · 94% Performance modeling and evaluation · 4% Embedded and real-time systems · 2% |
Topics — the 14 heaviest of 20, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
fault tolerance |
0.0 | 1 | 2004 | Basic Concepts and Taxonomy of Dependable and Secure Computing · IEEE Trans. Dependable Secur. Comput. 2004 |
Cryptographic primitives and cryptanalysis
cryptographic foundations |
0.0 | 1 | 2012 | Privacy and Cybersecurity: The Next 100 Years · Proc. IEEE 2012 |
Privacy and data protection
data confidentiality |
0.0 | 1 | 2004 | Basic Concepts and Taxonomy of Dependable and Secure Computing · IEEE Trans. Dependable Secur. Comput. 2004 |
Cryptographic primitives and cryptanalysis
message authentication codes |
0.0 | 3 | 1987 | On Access Checking in Capability-Based Systems · IEEE Trans. Software Eng. 1987 On Access Checking in Capability-Based Systems · S&P 1986 A Formal Statement of the MMS Security Model · S&P 1984 |
Authentication and access control › access control › permission management
access right propagation |
0.0 | 2 | 1987 | On Access Checking in Capability-Based Systems · IEEE Trans. Software Eng. 1987 On Access Checking in Capability-Based Systems · S&P 1986 |
Systems and software security › multilevel security
bell-lapadula enforcement |
0.0 | 2 | 1987 | On Access Checking in Capability-Based Systems · IEEE Trans. Software Eng. 1987 On Access Checking in Capability-Based Systems · S&P 1986 |
Authentication and access control › access control models
capability-based access control |
0.0 | 2 | 1987 | On Access Checking in Capability-Based Systems · IEEE Trans. Software Eng. 1987 On Access Checking in Capability-Based Systems · S&P 1986 |
Systems and software security
multilevel security |
0.0 | 2 | 1984 | A Security Model for Military Message Systems · ACM Trans. Comput. Syst. 1984 Hardware Requirements for Secure Computer Systems: A Framework · S&P 1984 |
Systems and software security
operating system security |
0.0 | 1 | 1986 | On Access Checking in Capability-Based Systems · S&P 1986 |
Systems and software security
formal security model |
0.0 | 1 | 1984 | A Formal Statement of the MMS Security Model · S&P 1984 |
Programming languages and type systems
abstract data types |
0.0 | 1 | 1980 | An Abstract Type for Statistics Collection in Simula · ACM Trans. Program. Lang. Syst. 1980 |
Performance modeling and evaluation › queueing models
priority queueing |
0.0 | 1 | 1976 | An endogenous priority model for load control in combined batch - interactive computer systems · SIGMETRICS 1976 |
Performance modeling and evaluation
queueing models |
0.0 | 1 | 1976 | An endogenous priority model for load control in combined batch - interactive computer systems · SIGMETRICS 1976 |
Embedded and real-time systems › embedded system security
secure embedded system |
0.0 | 1 | 1984 | Hardware Requirements for Secure Computer Systems: A Framework · S&P 1984 |
Methods — techniques the papers use, named apart from their topics
taxonomy · 0.1definitions · 0.1architectural criteria development · 0.0capability taxonomy · 0.0formal specification · 0.0formal modeling · 0.0numerical methods · 0.0markov chain analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Cybersecurity for Future Presidents: An Interdisciplinary Non-majors CourseabstractWe discuss the design and implementation of an interdisciplinary non-majors course Cybersecurity for future presidents, which broadens the types of computational courses available for non-majors. The goal of our course is to build awareness of cybersecurity issues and to promote thinking critically about them. Student debates on controversial cybersecurity issues facing society today motivate the technical and policy content. We present student assessment results, which demonstrate an increase of students' awareness, and outline directions for future course improvements. Aparna Das, David P. Voorhees, Cynthia Choi, Carl E. Landwehr |
SIGCSE | 4 |
| 2017 | Software Systems Engineering programmes a capability approach
Carl E. Landwehr, Jochen Ludewig, Robert Meersman, David Lorge Parnas, Peretz Shoval, Yair Wand, David M. Weiss 0001, Elaine J. Weyuker |
J. Syst. Softw. | 1 |
| 2013 | A building code for building code: putting what we know works to workabstractSystems of programs control more and more of our critical infrastructures. Forty years of system development and research have taught us many lessons in how to build software that is reliable, relatively free of vulnerabilities, and can enforce security policies. Those years of experience seem not to have taught us how to get these lessons put into practice, particularly with respect to security, except in a few specialized places. This essay suggests an approach to capturing what we know in a way that can make a difference in systems on which we all rely. Carl E. Landwehr |
ACSAC | 1 |
| 2012 | Prolog to the Section on Privacy and Cybersecurity
Carl E. Landwehr |
Proc. IEEE | 1 |
| 2012 | Privacy and Cybersecurity: The Next 100 YearsabstractThe past and the future of privacy and cybersecurity are addressed from four perspectives, by different authors: theory and algorithms, technology, policy, and economics. Each author considers the role of the threat from the corresponding perspective, and each adopts an individual tone, ranging from a relatively serious look at the prospects for improvement in underlying theory and algorithms to more lighthearted considerations of the unpredictable futures of policy and economics. Carl E. Landwehr, Dan Boneh, John C. Mitchell, Steven M. Bellovin, Susan Landau 0001, Michael E. Lesk |
Proc. IEEE | 1 |
| 2010 | History of US Government Investments in Cybersecurity Research: A Personal PerspectiveabstractThis paper traces the history of cybersecurity research funding by the U.S. government. Difficulties in accurately measuring the level of U.S. government research funding for cybersecurity are first described. Some of the legislative and bureaucratic mechanisms involved in funding and reporting such research today are reviewed. A qualitative, personal perspective on the ups and downs of US cybersecurity research funding from the late 1960s to 2010 is then provided. The essay is written for the thirtieth anniversary meeting of the IEEE Symposium on Security and Privacy, held in May 2010. Carl E. Landwehr |
IEEE Symposium on Security and Privacy | 1 |
| 2004 | Basic Concepts and Taxonomy of Dependable and Secure ComputingabstractThis paper gives the main definitions relating to dependability, a generic concept including a special case of such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic definitions are given first. They are then commented upon, and supplemented by additional definitions, which address the threats to dependability and security (faults, errors, failures), their attributes, and the means for their achievement (fault prevention, fault tolerance, fault removal, fault forecasting). The aim is to explicate a set of general concepts, of relevance across a wide range of situations and, therefore, helping communication and cooperation among a number of scientific and technical communities, including ones that are concentrating on particular types of system, of system failures, or of causes of system failures. Algirdas Avizienis, Jean-Claude Laprie, Brian Randell, Carl E. Landwehr |
IEEE Trans. Dependable Secur. Comput. | 4 |
| 2003 | Challenges and Recent Advances in Developing Trustworthy Software-Based Systems
Stephen S. Yau, Carl E. Landwehr, Jeffrey M. Voas, Thomas Weigert |
COMPSAC | 2 |
| 2003 | NSF Activities in Cyber Trustabstract"Cyber Trust" is an umbrella term under which NSF/CISE has organized research focused on improving the ability of a computer-based component or system to repel, resist, detect, or tolerate malicious attacks while providing a desired function. Cyber Trust encompasses security (in terms of secrecy, confidentiality, integrity and availability), as well as privacy, correctness, reliability, safety and survivability. Three primary programs support Cyber Trust research: Trusted Computing, Data and Application Security, and Network Security. In addition, the Embedded and Hybrid Systems program is concerned with trust in all types of embedded software and control systems. These programs are coordinated within CISE, and the responsible Program Directors work to assure that proposals submitted to one program that seem more suited to a different one, and proposals in which the work straddles program boundaries, receive appropriate review. This talk will discuss the current Cyber Trust programs and NSF's plans for the area. Carl E. Landwehr |
NCA | 1 |
| 2002 | Intrusion Tolerant Systems Workshop
Carl E. Landwehr, Steven M. Bellovin |
DSN | 1 |
| 2001 | A Security Model for Military Message Systems: RetrospectiveabstractWe favor an approach to building secure systems that includes an application-based security model. An instance of such a model and its formalization have been presented. Important aspects of the model are: (1) because it is framed in terms of operations and data objects that the user sees, the model captures the system's security requirements in a way that is understandable to users; (2) the model defines a hierarchy of entities and references; access to an entity can be controlled based on the path used to refer to it; (3) because the model avoids specifying implementation strategies, software developers are free to choose the most effective implementation; (4) the model and its formalization provide a basis for certifiers to assess the security of the system as a whole. Simplicity and clarity in the model's statement have been primary goals. The model's statement does not, however, disguise the complexity that is inherent in the application. In this respect, we have striven for a model that is as simple as possible but stops short of distorting the user's view of the system. The work reported demonstrates the feasibility of defining an application-based security model informally and subsequently formalizing it. Carl E. Landwehr, Constance L. Heitmeyer, John D. McLean |
ACSAC | 1 |
| 2001 | Panel: The next generation of acess control models (panel session): do we need them and what should they be?abstractResearch on access control models was started in the 1960s and 1970s by the two thrusts of mandatory and discretionary access control. Mandatory access control (MAC) came from the military and national security arenas whereas discretionary access control (DAC) had its roots in academic and commercial research laboratories. These two thrusts were dominant through the 1970s and 1980s almost to exclusion of any other approach to access control models. In the 1990s we have seen a dramatic shift towards pragmatism. The dominant access-control model of the 1990s is role-based access control (RBAC). It is now understood that RBAC encompasses MAC and DAC as special cases and goes beyond them in providing a policy-neutral framework. This SACMAT meeting has evolved from a highly successful and productive series of ACM workshops on RBAC. This panel will address the basic question of where do we go next with access control models. Do we need additional models or can we simply evolve the current set of RBAC models? Is RBAC fundamentally deficient in some way? Where should be go in terms of standards? Is there useful formal and theoretical work to be done in the access control models arena? The first meeting with the title SACMAT is a fitting place to address these questions. Ravi S. Sandhu, Elisa Bertino, Trent Jaeger, D. Richard Kuhn, Carl E. Landwehr |
SACMAT | 5 |
| 1997 | Protecting Unattended Computers Without SoftwareabstractIn many environments, users log in to workstations and then leave them unattended. Rather than trying to stop users from doing what comes naturally, this paper suggests a simple, hardware-based system that can protect computers in such an environment from unauthorized use by people with physical access to the monitor and keyboard. Requirements for the system are described some design issues are discussed, and a sketch of a design for an initial prototype is provided, together with an assurance argument for it. A prototype implementing many of the concepts described has been built; two dozen copies of a second prototype are soon to be installed in an office environment. Carl E. Landwehr |
ACSAC | 1 |
| 1997 | Security issues in networks with Internet accessabstractThis paper describes the basic principles of designing and administering a relatively secure network. The principles are illustrated by describing the security issues a hypothetical company faces as the networks that support its operations evolve from strictly private, through a mix of Internet and private nets, to a final state in which the Internet is finally integrated into its operations and the company participates in international electronic commerce. At each stage, the vulnerabilities and threats that the company faces, the countermeasures that it considers, and the residual risk the company accepts are noted. Network security policy and services are discussed, and a description of Internet architecture and vulnerabilities provides additional technical detail underlying the scenario. Lastly, a number of building blocks for secure networks are presented that can mitigate some of the vulnerabilities. Carl E. Landwehr, David M. Goldschlag |
Proc. IEEE | 1 |
| 1994 | A practical approach to high assurance multilevel secure computing serviceabstractCurrent projects aimed at providing MLS computing services rarely seem to exploit advances in related fields. Specifically, the concepts of data distribution, replication, and interoperation are currently receiving much attention in the commercial database system sector but have yet to be applied to the delivery of MLS computing services. This paper explains how these concepts might kelp deliver MLS computing services relatively, quickly and cheaply, and how they can ease integration of legacy systems and new technology into future MLS cooperative, distributed computing environments.> Judith N. Froscher, Myong H. Kang, John P. McDermott, Oliver Costich, Carl E. Landwehr |
ACSAC | 5 |
| 1994 | Perspectives on Database Security - Panel Summary
Matthew Morgenstern, Joachim Biskup, Klaus R. Dittrich, Carl E. Landwehr, Marvin Schaefer |
DBSec | 4 |
| 1993 | How Far Can You Trust A Computer?
Carl E. Landwehr |
SAFECOMP | 1 |
| 1987 | Database Security: Where are We?
Carl E. Landwehr |
DBSec | 1 |
| 1987 | On Access Checking in Capability-Based SystemsabstractPublic descriptions of capability-based system designs often do not clarify the necessary details concerning the propagation of access rights within the systems. A casual reader may assume that it is adequate for capabilities to be passed in accordance with the rules for data copying. A system using such a rule cannot enforce either the military security policy or the Bell and LaPadula rules. The paper shows why this problem arises and provides a taxonomy of capability-based designs. Within the space of design options defined by the taxonomy we identify a class of designs that cannot enforce the Bell-LaPadula rules and two designs that do allow their enforcement. Richard Y. Kain, Carl E. Landwehr |
IEEE Trans. Software Eng. | 2 |
| 1986 | On Access Checking in Capability-Based SystemsabstractPublic descriptions of capability-based system designs often do not clarify the necessary details concerning the propagation of access rights within the systems. A casual reader may assume that it is adequate for capabilities to be psssed in accordance with the rules for data copying. A system using such a rule cannot enforce either the military security policy or the Bell and LaPadula rules. The paper shows why this problem arises and provides a taxonomy of capability-based designs. Within the space of design options defined by the taxonomy we identify a class of designs that cannot enforce the Bell-LaPadula rules and two designs that do allow their enforcement. Richard Y. Kain, Carl E. Landwehr |
S&P | 2 |
| 1984 | Hardware Requirements for Secure Computer Systems: A FrameworkabstractThis report develops a new set of criteria for evaluating computer architectures that are to support systems with security requirements. Central to these criteria is the concept of a domain, here interpreted as a set of information and authorizations for the manipulation of that information in a comput system. Architectural requirements are grouped in three categories: logical structure, the physical structure. These criteria were developed in order to assess the utility of Navy standard computers as bases for secure embedded systems, but they are not specific to those computers. Carl E. Landwehr, John M. Carroll 0002 |
S&P | 1 |
| 1984 | A Formal Statement of the MMS Security ModelabstractTo provide a firm foundation for proofs about the security properties of a system specification or implementation, a formal statement of its security model is needed. This paper presents a formal model that corresponds to an informal, application-based security model for military message systems (MMS) that has been documented elsewhere. Following the formal statement, some considerations that led to its present form are discussed. The paper concludes with the statement of a "Basic Security Theorem" for the model. John D. McLean, Carl E. Landwehr, Constance L. Heitmeyer |
S&P | 2 |
| 1984 | A Security Model for Military Message SystemsabstractMilitary systems that process classified information must operate in a secure manner; that is, they must adequately protect information against unauthorized disclosure, modification, and withholding.A goal of current research in computer security is to facilitate the construction of multilevel secure systems, systems that protect information of different classifications from users with different clearances.Security models are used to define the concept of security embodied by a computer system.A single model, called the Bell and LaPadula model, has dominated recent efforts to build secure systems but has deficiencies.We are developing a new approach to defining security models based on the idea that a security model should be derived from a specific application.To evaluate our approach, we have formulated a security model for a family of military message systems.This paper introduces the message system application, describes the problems of using the Bell-LaPadula model in real applications, and presents our security model both informally and formally.Significant aspects of the security model are its definition of multilevel objects and its inclusion of application-dependent security assertions.Prototypes based on this model are being developed. Carl E. Landwehr, Constance L. Heitmeyer, John D. McLean |
ACM Trans. Comput. Syst. | 1 |
| 1980 | An Abstract Type for Statistics Collection in SimulaabstractAlthough the use of abstract types has been widely advocated as a specification and implementation technique, their use has often been associated with programming languages that are not widely available, and examples published to date are rarely taken from actual applications. SIMULA is a widely available language that supports the use of abstract types. The purposes of this paper are (1) to demonstrate the application of the concepts of data abstraction to a common problem; (2) to demonstrate the use of data abstraction in a widely available language; and (3) to provide a portable facility for statistics collection that may make the use of SIMULA more attractive. A discussion of the background of and requirements for an abstract type for statistics collection is presented, followed by a specification for the type using traces. A SIMULA implementation, with examples of its use, is given. Finally, implementation of the abstract type in other languages is discussed. Carl E. Landwehr |
ACM Trans. Program. Lang. Syst. | 1 |
| 1976 | An endogenous priority model for load control in combined batch - interactive computer systemsabstractA relatively high level analytical model for computer systems serving both batch and interactive users is presented. The model is unusual in its employment of an endogenous priority scheme to represent a class of strategies for controlling service to the two types of customers. Numerical methods developed by V. L. Wallace are used to generate steady state probability distributions for the infinite state Markov chain formed by the model. Data from the Michigan Terminal System, which includes a load controlling mechanism of the type modelled, is used to validate the model. Finally, additional parameter studies indicate that the model reflects the dynamic behavior of such system in a reasonable way. Carl E. Landwehr |
SIGMETRICS | 1 |
| 1976 | An Endogenous Priority Model for Load Control in Combined Batch-Interactive Computer Systems
Carl E. Landwehr |
Acta Informatica | 1 |