Identity based authenticated key agreement protocol on the vector decomposition problem

Abstract

Recently, the Vector Decomposition Problem on a two-dimensional vector space was proposed and proved to be at least as hard as the Computational Diffie-Hellman Problem on a one-dimensional subspace under certain conditions. As a result, a variety of cryptographic schemes based on the VD Problem have been suggested. In this thesis, we describe an Authenticated Key Agreement protocol on the VD Problem by modifying Chen and Kudla's AK protocol. Furthermore, we discuss some security attributes our AK protocol possesses.;최근 the Vector Decomposition (VD) problem이 제안되고 또한 이 문제가 어떤 특정한 조건하에서는 the Computational Diffie-Hellman 보다 어려운 문제임이 증명되면서 이 Vector Decomposition 에 기반한 여러 가지 Cryptographic schemes 이 제안되었다. 이 논문에서는 Chen과 Kudla의 Authenticated key agreement (AK) protocol을 VD problem 에 기반 한 것으로 개선시킨 AK protocol을 소개하고 그 protocol의 몇 가지 security 성질에 대해 설명한다.