Match!

The authenticated datagram protocol: A high performance, subtransport level, secure communication protocol

Published on May 1, 1993in Computers & Security3.062
· DOI :10.1016/0167-4048(93)90119-P
P.V. Rangan23
Estimated H-index: 23
(UCSD: University of California, San Diego)
Abstract
Advances in communication technologies have stimulated the development of computer networks that interconnect competing individuals, organizations, and even countries. In such computer networks, in order to communicate security, agents must establish secure channels to other agents. In this paper, we present a secure communication protocol called Authenticated Datagram Protocol (ADP) that establishes host-to-host secure channels across networks, and builds agent-to-agent channels on top of host-to-host channels. We show how such a protocol can be layered at the subtransport level of the network protocol hierarchy, so as to provide high performance and security even in the presence of untrustworthy entities on the network.
  • References (6)
  • Citations (1)
📖 Papers frequently viewed together
1987
7 Citations
1987
2 Citations
66 Citations
78% of Scinapse members use related papers. After signing in, all features are FREE.
References6
Newest
#1P.V. Rangan (UCSD: University of California, San Diego)H-Index: 23
Computing systems are evolving into large networks interconnecting organizations and even countries. The relationships among these organizations are characterized by the need for competition and cooperation without a common trusted agent. Trust arises primarily in establishing channels for secure communication. This paper presents an axiometric theory of trust in secure communication protocols. The paper introduces basic notions about developing a logic or a theory, and shows that logics of beli...
18 CitationsSource
#1Richard A. Kemmerer (UCSB: University of California, Santa Barbara)H-Index: 32
An approach to analyzing encryption protocols using machine-aided formal verification techniques is presented. The properties that the protocol should preserve are expressed as state invariants, and the theorems that must be proved to guarantee that the cryptographic facility satisfies the invariants are automatically generated by the verification system. A formal specification of an example system is presented, and several weaknesses that were revealed by attempting to verify and test the speci...
131 CitationsSource
Research on encryption-based secure communication protocols has reached a stage where it is feasible to construct end-to-end secure protocols. The design of such a protocol, built as part of a remote procedure call package, is described. The security abstraction presented to users of the package, the authentication mechanisms, and the protocol for encrypting and verifying remote calls are also described.
105 CitationsSource
Public-key signature systems can be vulnerable to attack if the protocols for signing messages allow a cryptanalyst to obtain signatures on arbitrary messages of the cryptanalyst's choice. This vulnerability is shown to arise from the homomorphic structure of public- key systems. A method of foiling the attack is described.
93 CitationsSource
#1Victor L. Voydock (BBN Technologies)H-Index: 3
#2Stephen T. Kent (BBN Technologies)H-Index: 24
The implications of adding security mechanisms to high-level network protocols operating in an open-system environment are analyzed. First the threats to security that may arise in such an environment are described, and then a set of goals for communications security measures is established. This is followed by a brief description of the two basic approaches to communications security, link-oriented measures and end-to-end measures, which concludes that end-to-end measures are more appropriate i...
316 CitationsSource
Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee. Both conventional and public-key encryption algorithms are considered as the basis for protocols.
2,186 CitationsSource
Cited By1
Newest
Dynamic routing protocols play an important role in today's networks. In communication networks, in a current data transmission session, failing nodes and links is a destructor event which loses packets immediately and it can also waste network resources and services seriously. Sometimes failing nodes can disconnect data transmission and, therefore, lost packets must be retransmitted by new session. In this situation, the routing algorithm must discard failed nodes and must repair paths of sessi...
6 CitationsSource