A public-key based authentication and key establishment protocol coupled with a client puzzle

2003 ◽  
Vol 54 (9) ◽  
pp. 810-823 ◽  
Author(s):  
M.C. Lee ◽  
Chun-Kan Fung
Keyword(s):  
Author(s):  
Dulal C. Kar ◽  
Hung L. Ngo ◽  
Clifton J. Mulkey

It is challenging to secure a wireless sensor network (WSN) because of its use of inexpensive sensor nodes of very limited processing capability, memory capacity, and battery life that preclude using traditional security solutions. Due to perceived excessive computational and architectural overhead, public key algorithms are altogether avoided for WSNs. Currently security in WSNs is provided using only symmetric key cryptography, but it requires keys to be embedded in sensor nodes before deployment and the entire network has to go through a key establishment phase after deployment. Accordingly, in this chapter, we summarize, discuss, and evaluate recent results reported in literature on sensor network security protocols such as for key establishment, random key pre-distribution, data confidentiality, and broadcast authentication. In addition, we discuss promising research results in public key cryptography for WSNs, particularly related to elliptic curve cryptography and its application for identity based encryption.


2016 ◽  
Author(s):  
Jiye Kim ◽  
Jongho Moon ◽  
Jaewook Jung ◽  
Donghoon Lee ◽  
Youngsook Lee ◽  
...  

2013 ◽  
pp. 471-492
Author(s):  
Dulal C. Kar ◽  
Hung L. Ngo ◽  
Clifton J. Mulkey

It is challenging to secure a wireless sensor network (WSN) because of its use of inexpensive sensor nodes of very limited processing capability, memory capacity, and battery life that preclude using traditional security solutions. Due to perceived excessive computational and architectural overhead, public key algorithms are altogether avoided for WSNs. Currently security in WSNs is provided using only symmetric key cryptography, but it requires keys to be embedded in sensor nodes before deployment and the entire network has to go through a key establishment phase after deployment. Accordingly, in this chapter, we summarize, discuss, and evaluate recent results reported in literature on sensor network security protocols such as for key establishment, random key pre-distribution, data confidentiality, and broadcast authentication. In addition, we discuss promising research results in public key cryptography for WSNs, particularly related to elliptic curve cryptography and its application for identity based encryption.


Author(s):  
Kannan Balasubramanian ◽  
Mala K.

This chapter focusses on Secure Key Exchange protocols executed among a group of parties, called group key exchange (GKE) protocols. Authentication and Key Establishment are very important in any secure communication. Authentication is generally based on long-term keys which can be associated with identities. To associate identities with long-term keys, we can assume the existence of a public-key infrastructure (PKI) which provides parties with some mechanisms for secure key registration and secure access to long-term keys of prospective peers. In most cases, there is also a need for some temporary keys. The Group Key Exchange protocols can be classified as Centralized, Distributed or Contributory. A few toolkits such as Spread and Cliques for the implementation of Group Key Exchange Protocols are also discussed.


Author(s):  
Joo Yeon Cho ◽  
Andrew Sergeev

The demand on MACsec in Ethernet is increasing substantially since MACsec fits well for industrial applications which require strong security as well as efficiency. To provide a long-term security, the MACsec protocol should be resistant to future attacks including quantum attacks. In this paper, MACsec is analysed under a quantum attack scenario. To achieve 128-bit quantum security, AES (Advanced Encryption Standard) algorithms defined in MACsec should mandate to use 256-bit keys. On the other hand, classical public-key cryptosystems in MKA are not secure at all against quantum attacks so that they need to be replaced by post-quantum crypto schemes in a quantum world. We propose an authenticated post-quantum key establishment protocol which is suitable for long-term secure MACsec. The proposed protocol is used in the hybrid mode, an ephemeral key exchange, and an end-to-end encryption. We verified by experiments that the proposed protocol can be deployed in existing a MACsec-enabled Ethernet network.


2020 ◽  
Vol 15 (1) ◽  
pp. 18-30
Author(s):  
Oleg Taraskin ◽  
Vladimir Soukharev ◽  
David Jao ◽  
Jason T. LeGrow

AbstractPassword authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence of public key infrastructure. We propose the first quantum-resistant password-authenticated key exchange scheme based on supersingular elliptic curve isogenies. The scheme is built upon supersingular isogeny Diffie-Hellman [15], and uses the password to generate permutations which obscure the auxiliary points. We include elements of a security proof, and discuss roadblocks to obtaining a proof in the BPR model [1]. We also include some performance results.


Radiotekhnika ◽  
2021 ◽  
pp. 66-72
Author(s):  
E.V. Kotukh ◽  
O.V. Severinov ◽  
A.V. Vlasov ◽  
A.O. Tenytska ◽  
E.O. Zarudna

Implementation of a successful attack on classical public key cryptosystems becomes more and more real with the advent of practical results in the implementation of Shor's and Grover's algorithms on quantum computers. Modern results in tackling the problem of building a quantum computer of sufficiently power justify the need to revise the existing approaches and determine the most effective in terms of solving problems of post-quantum cryptography. One of these promising research priorities is the study of the cryptosystems based on non-abelian groups. The problems of conjugacy search, membership search, and others are difficult to solve in the theory of non-abelian groups and are the basis for building provably secure public key cryptosystems. This paper gives an overview of the most frequently discussed algorithms using non-abelian groups: matrix groups braid groups, semi direct products, and algebraic erasers (AE). The analysis of the construction of encryption and decryption schemes, key establishment mechanisms is given. Many non-abelian group-based key establishment protocols are associated with the Diffie – Hellman (DH) protocol. The paper analyzes the properties of non-abelian group public key encryption schemes. Various cryptographic primitives using non-commutative groups as a basis for post-quantum schemes are considered.


Sign in / Sign up

Export Citation Format

Share Document