Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wayne Gramlich

dblp:75/606 · also Wayne C. Gramlich · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1985
—ORCID · none

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

Computer networks · 1Security and privacy · 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.

Computer networks
1 paper
Internet architecture and protocols · 100%
Network and information security
1 paper
Authentication and access control · 67% Privacy and data protection · 33%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › link-layer protocols
local area network protocol
0.011985
The Desktop Computer as a Network Participant · IEEE J. Sel. Areas Commun. 1985
Internet architecture and protocols
protocol implementation
0.011985
The Desktop Computer as a Network Participant · IEEE J. Sel. Areas Commun. 1985
Internet architecture and protocols › protocol design
protocol stack design
0.011985
The Desktop Computer as a Network Participant · IEEE J. Sel. Areas Commun. 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

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

upcall/downcall organization · 0.0fake transactions · 0.0cryptographic protocol design · 0.0copy minimization · 0.0application-tailored protocol implementation · 0.0
YearPublicationVenuePosition
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&P2
1985 The Desktop Computer as a Network Participant
abstract
A desktop personal computer can be greatly extended in usefulness by attaching it to a local area network and implementing a full set of network protocols, just as one might provide for a mainframe computer. Such protocols are a set of tools that allow the desktop computer not just to access data elsewhere, but to participate in the computing milieu much more intensely. There are two challenges to this proposal. First, a personal computer may often be disconnected from the network, so it cannot track the network state and it must be able to discover and resynchronize with that state very quickly. Second, full protocol implementations have often been large and slow, two attributes that could be fatal in a small computer. This paper reports a network implementation for the IBM Personal Computer that uses several performance-oriented design techniques with wide applicability: an upcall/downcall organization that simplifies structure; implementation layers that do not always coincide with protocol specification layers; copy minimization; and tailoring of protocol implementations with knowledge of the application that will use them. The size and scale of the resulting package of programs, now in use in our laboratory for two years, is quite reasonable for a desktop computer and the techniques developed are applicable to a wider range of network protocol designs.
Jerome H. Saltzer, David D. Clark, John Romkey, Wayne Gramlich
IEEE J. Sel. Areas Commun.4