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

Sandra L. Murphy

dblp:53/6658 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 2 · 2 first-authorSecurity and privacy · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Network security · 93% Cryptographic primitives and cryptanalysis · 7%
Computer networks
3 papers
Transport protocols and congestion control · 42% Routing and switching · 29% Network management and operations · 16%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Network security
routing security
0.021999
BGP Vulnerabilities and Security Options · NDSS 1999
Digital signature protection of the OSPF routing protocol · NDSS 1996
Network security › routing security › interdomain routing security
BGP security
0.011999
BGP Vulnerabilities and Security Options · NDSS 1999
Transport protocols and congestion control
connection management
0.011991
Connection management for the transport layer: service specification and protocol verification · IEEE Trans. Commun. 1991
Network management and operations
protocol verification
0.011991
Connection management for the transport layer: service specification and protocol verification · IEEE Trans. Commun. 1991
Transport protocols and congestion control
transport layer
0.011991
Connection management for the transport layer: service specification and protocol verification · IEEE Trans. Commun. 1991
Routing and switching › inter-domain routing
BGP
0.011999
BGP Vulnerabilities and Security Options · NDSS 1999
Routing and switching
inter-domain routing
0.011999
BGP Vulnerabilities and Security Options · NDSS 1999
Internet architecture and protocols › protocol specification
formal specification
0.011988
Service specification and protocol construction for the transport layer · SIGCOMM 1988
Transport protocols and congestion control
transport protocol design
0.011988
Service specification and protocol construction for the transport layer · SIGCOMM 1988
Distributed computing theory › mutual exclusion
dining philosophers
0.011988
A Note on the Drinking Philosophers Problem · ACM Trans. Program. Lang. Syst. 1988
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.011996
Digital signature protection of the OSPF routing protocol · NDSS 1996
Distributed computing theory
mutual exclusion
0.011988
A Note on the Drinking Philosophers Problem · ACM Trans. Program. Lang. Syst. 1988

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

digital signature · 0.0asymmetric cryptography · 0.0state transition system · 0.0safety and progress requirements · 0.0safety and progress properties · 0.0formal specification · 0.0
YearPublicationVenuePosition
1999 BGP Vulnerabilities and Security Options
Sandra L. Murphy
NDSS1
1996 Digital signature protection of the OSPF routing protocol
abstract
The routing protocols used to disseminate routing information throughout the Internet are not protected from intruders or faulty router participants. This paper reports on work in progress to protect the OSPF routing protocol through the use of cryptography, specifically, digital signatures. The routing information is signed with an asymmetric cryptographic algorithm, allowing each router recipient to check the source and integrity of the information. This paper discusses the fundamental issues in security of routing protocols, reviews the basics of OSPF operation, describes the proposed design and discusses remaining vulnerabilities.
Sandra L. Murphy, Madelyn R. Badger
NDSS1
1991 Connection management for the transport layer: service specification and protocol verification
abstract
A symmetric connection management service between two service access points is specified, using a state transition system and safety and progress requirements. At each access point. the user can request connection establishment, request connection termination, and signal whether or not they are willing to accept connection requests from the remote user. The protocol can indicate connection establishment, connection termination, and rejection of a connection establishment request. The authors then specify a protocol and verify that it offers the service, given communication channels between the access points that can lose, reorder, and duplicate messages, but which guarantee delivery of a message that is repeatedly sent. The protocol achieves the service using 2-way and 3-way handshakes, and can be directly combined with any existing single-connection data transfer protocols to provide a transport layer protocol that offers both connection management and data transfer services. The protocol and service are compared to TCP and its intended service, and to ISO TP Class 4 and its intended service.>
Sandra L. Murphy, A. Udaya Shankar
IEEE Trans. Commun.1
1988 Service specification and protocol construction for the transport layer
abstract
In a computer network, the transport layer uses the service offered by the network layer and in turn offers its users the transport service of reliable connection management and data transfer. We provide a formal specification of the transport service in terms of an event-driven system and safety and progress properties. We construct three verified transport protocols that offer the transport service. The first transport protocol assumes a perfect network service, the second assumes loss-only network service, and the third assumes loss, reordering and duplication network service.
Sandra L. Murphy, A. Udaya Shankar
SIGCOMM1
1988 A Note on the Drinking Philosophers Problem
Sandra L. Murphy, A. Udaya Shankar
ACM Trans. Program. Lang. Syst.1