Security Analysis of Authenticated Key Exchange Protocol Based on the q-th Root Problem*This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2005-217-C00002).

Authors:
Kyung-Ah Shim
Affiliations:
The author is with the Dept. of Mathematics, Ewha Womans University, 11-1 Daehyun-dong, Seodaemun-gu, Seoul, Republic of Korea. E-mail: kashim@ewha.ac.kr
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 0
Cited 5

Characterization of the Thai hostgraph

Proceedings of the 2nd international conference on Ubiquitous information management and communication
Socio-sense: a system for analysing the societal behavior from long term web archive

APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Connectivity of the Thai web graph

APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Web community analysis and its application to language specific crawling

Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
A Comprehensive Study of Techniques for URL-Based Web Page Language Classification

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.