Fully-fledged two-way public key authentication and key agreement for low-cost terminals

Beller, M.J.; Yacobi, Yacov

doi:10.1049/el:19930666

Cited by 55 publications

(16 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most efficient of these protocols is the two-pass protocol. The Beller-Yacobi two-pass protocol (BY-2) [Beller93] (typically) employs RSA encryption and either ElGamal or DSA signature methods plus a symmetric key method. It was designed to reduce the computational (# CPU cycles) cost for one of its participants (a smartcard or a wireless terminal) interacting with a higher power peer.…”

Section: Id a || Id B || E(key Pair N A )mentioning

confidence: 99%

Constraints and Approaches for Distributed Mobile AD-HOC Network Security

Fitzgibbons¹,

Das²,

Hash³

2005

View full text Add to dashboard Cite

REPORT DOCUMENTATION PAGE Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to

show abstract

Section: Id a || Id B || E(key Pair N A )mentioning

confidence: 99%

Constraints and Approaches for Distributed Mobile AD-HOC Network Security

Fitzgibbons¹,

Das²,

Hash³

2005

View full text Add to dashboard Cite

show abstract

“…Carlsen, [6], proposed some enhancements to the protocols in [2]. Xu and Wang , [19], improved the protocol in [3]. In addition, it is worth noting that the ASPeCT project [1] has systematicaHy studied the authentication framework based on the public-key cryptosystems and also discussed how to provide end-to-end services using trusted third parties in the third generation PCS.…”

Section: Introductionmentioning

confidence: 99%

“…Over time, several people have attempted to implement the direct mutual authentication between the portable and network using asymmetric cryptographic methods. BeHer et al, [2,3], proposed several authentication protocols based on Modular Square Root (MSR) and/or EIGamal signature scheme. Carlsen, [6], proposed some enhancements to the protocols in [2].…”

Section: Introductionmentioning

confidence: 99%

A New Authentication Protocol for Portable Communication Systems

Jansen

Tilborg

1999

Secure Information Networks

View full text Add to dashboard Cite

With the global deployment of portable communication systems and the ongoing developments in this area, one expects more and more sophisticated security features to be provided such as entity authentication, robust user identity confidentiality and non-repudiation services. Motivated by these new security requirements, this article analyzes the security of authentication protocols in several mobile communication industry standards, such as DAMPS, GSM, and TETRA, and several proposals for future mobile communication systems. A new authentieation protocol is presented to provide the above security services using symmetrie cryptographic techniques only. The security and complexity of the new protocol are analyzed and compared with the aforementioned protocols.B. Preneel (ed.), Secure Information Networks

show abstract

“…This work is further improved by Park et al [15]. Other key agreement and authentication protocols include the one by Beller and Yacobi [16]. A survey on key distribution and authentication for resource-starved devices in mobile environments is given in [17].…”

Section: Related Workmentioning

confidence: 99%

A key management scheme for wireless sensor networks using deployment knowledge

et al.

View full text Add to dashboard Cite

Abstract-To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and its improvements have been proposed. A common assumption made by these random key predistribution schemes is that no deployment knowledge is available. Noticing that in many practical scenarios, certain deployment knowledge may be available a priori, we propose a novel random key pre-distribution scheme that exploits deployment knowledge and avoids unnecessary key assignments. We show that the performance (including connectivity, memory usage, and network resilience against node capture) of sensor networks can be substantially improved with the use of our proposed scheme. The scheme and its detailed performance evaluation are presented in this paper.

show abstract

Fully-fledged two-way public key authentication and key agreement for low-cost terminals

Cited by 55 publications

References 1 publication

Constraints and Approaches for Distributed Mobile AD-HOC Network Security

Constraints and Approaches for Distributed Mobile AD-HOC Network Security

A New Authentication Protocol for Portable Communication Systems

A key management scheme for wireless sensor networks using deployment knowledge

Contact Info

Product

Resources

About