scispace - formally typeset
Topic

Authentication

About: Authentication is a(n) research topic. Over the lifetime, 74766 publication(s) have been published within this topic receiving 867108 citation(s).

...read more

Papers
  More

Open accessProceedings ArticleDOI: 10.1109/SECPRI.2003.1199337
Haowen Chan1, Adrian Perrig1, Dawn Song1Institutions (1)
11 May 2003-
Abstract: Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because the nodes could be physically compromised by an adversary. We present three new mechanisms for key establishment using the framework of pre-distributing a random set of keys to each node. First, in the q-composite keys scheme, we trade off the unlikeliness of a large-scale network attack in order to significantly strengthen random key predistribution's strength against smaller-scale attacks. Second, in the multipath-reinforcement scheme, we show how to strengthen the security between any two nodes by leveraging the security of other links. Finally, we present the random-pairwise keys scheme, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.

...read more

  • Figure 2: Probability that a specific random communication link between two random nodes A, B can be decrypted by the adversary when the adversary has captured some set of x nodes that does not include A or B. Key ring size m = 200, probability of key-setup p = 0.33.
    Figure 2: Probability that a specific random communication link between two random nodes A, B can be decrypted by the adversary when the adversary has captured some set of x nodes that does not include A or B. Key ring size m = 200, probability of key-setup p = 0.33.
  • Figure 3: Maximum network sizes (p = 0.33, fm = 0.1)
    Figure 3: Maximum network sizes (p = 0.33, fm = 0.1)
  • Figure 1: The expected number of nodes an adversary needs to capture before it is able to eavesdrop on any link with probability 0.1, for various amounts of key overlap q. Key ring size m = 200 keys, probability of connection p = 0.5.
    Figure 1: The expected number of nodes an adversary needs to capture before it is able to eavesdrop on any link with probability 0.1, for various amounts of key overlap q. Key ring size m = 200 keys, probability of connection p = 0.5.
  • Figure 6: Network sizes for random pairwise key setup compared against the basic scheme with and without multipath key reinforcement. Link keys are 128bits, hash values are 80bits in this simulation. p = 0.33, fthreshold = 0.1
    Figure 6: Network sizes for random pairwise key setup compared against the basic scheme with and without multipath key reinforcement. Link keys are 128bits, hash values are 80bits in this simulation. p = 0.33, fthreshold = 0.1
  • Figure 4: Reinforcement and compromise statistics for base compromise probability b = 0.2
    Figure 4: Reinforcement and compromise statistics for base compromise probability b = 0.2
  • + 1

3,094 Citations


Open accessJournal ArticleDOI: 10.1145/358790.358797
Leslie Lamport1Institutions (1)
Abstract: A method of user password authentication is described which is secure even if an intruder can read the system's data, and can tamper with or eavesdrop on the communication between the user and the system. The method assumes a secure one-way encryption function and can be implemented with a microcomputer in the user's terminal.

...read more

Topics: S/KEY (67%), Password (65%), One-time password (65%) ...read more

2,740 Citations


Proceedings ArticleDOI: 10.1145/381677.381696
Adrian Perrig1, Robert Szewczyk1, Victor Wen1, David E. Culler1  +1 moreInstitutions (1)
16 Jul 2001-
Abstract: As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, much research has focused on making sensor networks feasible and useful, and has not concentrated on security.We present a suite of security building blocks optimized for resource-constrained environments and wireless communication. SPINS has two secure building blocks: SNEP and mTESLA SNEP provides the following important baseline security primitives: Data confidentiality, two-party data authentication, and data freshness. A particularly hard problem is to provide efficient broadcast authentication, which is an important mechanism for sensor networks. mTESLA is a new protocol which provides authenticated broadcast for severely resource-constrained environments. We implemented the above protocols, and show that they are practical even on minimal hardware: the performance of the protocol suite easily matches the data rate of our network. Additionally, we demonstrate that the suite can be used for building higher level protocols.

...read more

2,696 Citations


Open accessJournal ArticleDOI: 10.1145/359657.359659
Abstract: 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.

...read more

Topics: Authenticated encryption (70%), On-the-fly encryption (67%), Encryption (67%) ...read more

2,622 Citations


Journal ArticleDOI: 10.1145/77648.77649
Abstract: Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws. A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method.

...read more

2,525 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202247
20212,688
20204,435
20195,712
20185,479
20175,061

Top Attributes

Show by:

Topic's top 5 most impactful authors

Ashok Kumar Das

122 papers, 4.9K citations

Lu Zhou

117 papers, 874 citations

Muhammad Khurram Khan

82 papers, 3.2K citations

Saru Kumari

73 papers, 2.9K citations

Neeraj Kumar

72 papers, 3.2K citations

Network Information
Related Topics (5)
Encryption

98.3K papers, 1.4M citations

95% related
Access control

32.6K papers, 475K citations

95% related
Cryptography

37.3K papers, 854.5K citations

94% related
Intrusion detection system

28.4K papers, 509.5K citations

94% related
Public-key cryptography

27.2K papers, 547.7K citations

94% related