Robert W. Baldwin

dblp:95/1072 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Security and privacy · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Network and information security
1 paper
Authentication and access control · 67% Privacy and data protection · 33%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Computer networks
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › distributed information retrieval
query routing
0.011985
An Architecture for Large Scale Information Systems · SOSP 1985
Privacy and data protection
anonymity
0.011985
Cryptographic Protocol for Trustable Match Making · S&P 1985
Authentication and access control
anonymous authentication
0.011985
Cryptographic Protocol for Trustable Match Making · S&P 1985
Authentication and access control › authentication
authentication protocols
0.011985
Cryptographic Protocol for Trustable Match Making · S&P 1985
Distributed systems
distributed information systems
0.011985
An Architecture for Large Scale Information Systems · SOSP 1985
Wireless networking
packet radio network
0.011985
An Architecture for Large Scale Information Systems · SOSP 1985

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

query routing · 0.0broadcast communication · 0.0fake transactions · 0.0cryptographic protocol design · 0.0
YearPublicationVenuePosition
1989 Access control by Boolean expression evaluation
abstract
An access control mechanism based on Boolean expression evaluation is presented. This mechanism allows the implementation of customer-specified, rather than vendor-specified, security policies. The mechanism makes it possible to easily implement such conventional mechanisms as access control lists, named access control lists, user groups, user attributes, user capability lists, and user roles. Additional access restrictions based on time, day, date, location, load average, or any customer-supplied function can be incorporated into access decisions. This mechanism can directly express Clark-Wilson triples, and it can easily implement policies that are difficult or impossible to implement using the Bell-LaPadula model.>
Donald V. Miller, Robert W. Baldwin
ACSAC2
1985 An Architecture for Large Scale Information Systems
abstract
A new type of system architecture is described that uses both duplex ct)mmunication and wide-area simplex commtmication to implement a single service.A working community inlbrmation system based on this architecture is discussed fiom a systems perspective, with an emphasis on the unique way in which processing is distributed among a confederation of shared servers and private personal systems.In the community infimnation system, each personal system maintains a local, user-defined subset of the databases stored on the shared servers.I)atabase updates are transnfitted to the personal systems via a broadcast packet radio system.This design allows many queries to be processed completely at users' personal machines, and thus reduces the reliance on shared servers.A unifying design principle is that the system is seen as a collection of independent shared and personal databascs, as opposed to a single monolithic database.Query routing is used to hide the system's division into component databases from a user.
David K. Gifford, Robert W. Baldwin, Stephen T. Berlin, John M. Lucassen
SOSP2
1985 Cryptographic Protocol for Trustable Match Making
abstract
A problem with conflicting goals of anonymity and authentication is defined and a cryptographic protocol that solves the problem is presented. The protocol uses an authentication scheme that provides the desired degree of anonymity and authentication. Fake transactions are used to detect active attackers, and to camouflage information that cannot be hidden cryptographically.
Robert W. Baldwin, Wayne Gramlich
S&P1