Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in electrical engineering

A Novel Key Exchange Protocol Provably Secure Against Man-in-the-Middle Attack

Abhijit Chowdhury, Shubhajit Nath, Jaydeep Howlader

Published Jan 1, 2014• 0 citations
Publisher
DOI
10.1007/978-3-319-03692-2_22

Related papers

Multi-party Key Exchange Protocol and Man inthe Middle Attack

Turgut Hanoymak, Ömer Küsmüş, Tuba Güleşçe Tatlı

•Sep 11, 2018•0 citations

A Practical Man-In-The-Middle Attack on Signal-Based Key Generation Protocols

Simon Eberz, Martin Strohmeier, Matthias Wilhelm +1 more

Lecture notes in computer science•Jan 1, 2012•90 citations

Security Analysis of Authenticated Key Exchange Protocol Based on the q-th Root Problem

K.-A. SHIM

Johnston and Gemmell proposed an authenticated key exchange protocol based on the difficulty of the q-th root problem. They showed that it is provably secure against man-in-the-middle attacks. In this paper we show that the protocol is insecure against an unknown key-share attack and does not achieve forward secrecy.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2007•1 citation

A New Strongly Secure Authenticated Key Exchange Protocol

Qingfeng Cheng, Chuangui Ma, Xuexian Hu

Lecture notes in computer science•Jan 1, 2009•11 citations

An Efficient and Provable Secret Shared Key Computation for Cryptographic Protocol Across Insecure Channel

Ndibanje Bruce, Hyunho Kim, Suhyun Park +1 more

Data exchange over public network requires for the most part an important security mechanism enabling to both sender and receiver the property that they can mutual authenticate using different identification parameters playing the vital role of secret shared key computation. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than "classical" Diffe-Hellman key exchange which provides no authentication at all and suffer from man-in-the-middle attack. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by Scyther tool to verify the provability of the sameness 'shared secret value. With the standards cryptographic assumptions, the simulation result reveals that the protocol is practical and provably-secure. Thus, the proposed cryptographic protocol is awfully, straightforward, valuable, and resilient to know attacks.

International Conference on Advanced Information Networking and Applications (AINA)•Mar 1, 2015•0 citations

An Efficient Leakage-Resilient Authenticated Key Exchange Protocol

SeongHan Shin, Kazukuni Kobara, Hideki Imai

IEEE International Symposium on Information Theory (ISIT)•Dec 14, 2004•0 citations
Data exchange over public network requires for the most part an important security mechanism enabling to both sender and receiver the property that they can mutual authenticate using different identification parameters playing the vital role of secret shared key computation. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than "classical" Diffe-Hellman key exchange which provides no authentication at all and suffer from man-in-the-middle attack. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by Scyther tool to verify the provability of the sameness 'shared secret value. With the standards cryptographic assumptions, the simulation result reveals that the protocol is practical and provably-secure. Thus, the proposed cryptographic protocol is awfully, straightforward, valuable, and resilient to know attacks.