Efficient 3-Pass Password-Based Key Exchange Protocol with Low Computational Cost for Client

2000 ◽  
pp. 147-155
Author(s):  
Hyoungkyu Lee ◽  
Kiwook Sohn ◽  
Hyoungkyu Yang ◽  
Dongho Won
Keyword(s):  
Computational Cost ◽  
Key Exchange ◽  
Key Exchange Protocol ◽  
Low Computational Cost

scholarly journals ESIKE: An efficient and secure internet key  exchange protocol

2021 ◽  
Author(s):  
marwa ahmim ◽  
Ahmed Ahmim ◽  
Mohamed amine Ferrag ◽  
Nacira ghoualmi-zine ◽  
Leandros Maglaras
Keyword(s):  
Computational Cost ◽  
Key Exchange ◽  
Key Exchange Protocol ◽  
Man In The Middle ◽  
Key Exchange Protocols ◽  
Perfect Forward Secrecy ◽  
High Level ◽  
Use Of Internet ◽  
Low Computational Cost ◽  
Internet Key Exchange

Abstract The use of Internet key exchange protocols in IP Security architecture and in IoT environments has vulnerabilities against various malicious attacks and affects communication efficiency. To address these weaknesses, we propose a novel efficient and secure Internet key exchange protocol (ESIKE), which achieves a high level of security along with low computational cost and energy consumption. ESIKE achieves perfect forward secrecy, anonymity, known-key security and untraceability properties. ESIKE can resist several attacks, such as, replay, DoS, eavesdropping, man-in-the-middle and modification. In addition, the formal security validation using AVISPA tools confirms the superiority of ESIKE in terms of security.

Key Exchange Protocol Supporting Mobility and Multihoming

2006 ◽  
Vol 1 (2) ◽  
pp. 52-70
Author(s):  
Mohammed A. Tawfiq ◽  
◽  
Sufyan T. Faraj Al-janabi ◽  
Abdul-Karim A. R. Kadhim ◽  
◽  
...  
Keyword(s):  
Key Exchange ◽  
Key Exchange Protocol

Efficient group key exchange protocol with strong security

2010 ◽  
Vol 30 (7) ◽  
pp. 1805-1808
Author(s):  
Shao-feng DENG ◽  
Fan DENG ◽  
Yi-fa LI
Keyword(s):  
Key Exchange ◽  
Key Exchange Protocol ◽  
Group Key ◽  
Group Key Exchange

RIPIC BASED KEY EXCHANGE PROTOCOL

2020 ◽  
Vol 9 (12) ◽  
pp. 11169-11177
Author(s):  
A. J. Meshram ◽  
C. Meshram ◽  
S. D. Bagde ◽  
R. R. Meshram
Keyword(s):  
Key Exchange ◽  
Key Exchange Protocol

scholarly journals Computing Expectiles Using k-Nearest Neighbours Approach

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 645
Author(s):  
Muhammad Farooq ◽  
Sehrish Sarfraz ◽  
Christophe Chesneau ◽  
Mahmood Ul Hassan ◽  
Muhammad Ali Raza ◽  
...  
Keyword(s):  
Computational Cost ◽  
Real Life ◽  
Distance Measures ◽  
Computational Time ◽  
High Dimensional ◽  
Test Error ◽  
Nearest Neighbours ◽  
Comparable Performance ◽  
Asymmetric Least Squares ◽  
Low Computational Cost

Expectiles have gained considerable attention in recent years due to wide applications in many areas. In this study, the k-nearest neighbours approach, together with the asymmetric least squares loss function, called ex-kNN, is proposed for computing expectiles. Firstly, the effect of various distance measures on ex-kNN in terms of test error and computational time is evaluated. It is found that Canberra, Lorentzian, and Soergel distance measures lead to minimum test error, whereas Euclidean, Canberra, and Average of (L1,L∞) lead to a low computational cost. Secondly, the performance of ex-kNN is compared with existing packages er-boost and ex-svm for computing expectiles that are based on nine real life examples. Depending on the nature of data, the ex-kNN showed two to 10 times better performance than er-boost and comparable performance with ex-svm regarding test error. Computationally, the ex-kNN is found two to five times faster than ex-svm and much faster than er-boost, particularly, in the case of high dimensional data.

Sign in / Sign up

Export Citation Format

Share Document