Chaotic map based key agreement with/out clock synchronization |
| |
| Authors: | S Han E Chang |
| |
| Institution: | 1. CNR Istituto Motori, Napoli, Italy;2. INFN – LNF, XLab Frascati – Via E. Fermi, 40, I-00044 Frascati, Italy;3. RAS P.N. Lebedev Physical Institute, Leninsky Pr. 53, 119991 Moscow, Russia;4. NRN University MEPhI, Kashirskoe Sh. 31, 115409 Moscow, Russia;5. Dip. Scienze Geologiche, Univ. Roma3, Largo San Leonardo Murialdo 1, Roma, Italy;6. Dip. DICMA, Univ. Roma “Sapienza”, Via Eudossiana 18, Roma, Italy;1. Faculty of IET, German University in Cairo (GUC), Cairo 11865, Egypt;2. NISC Research Center, Nile University, Cairo 12588, Egypt;3. Department of Engineering Mathematics and Physics, Cairo University, Cairo 12613, Egypt;4. Radiation Engineering Department, NCRRT, Egyptian Atomic Energy Authority, 29 Nasr City, Cairo, Egypt;5. Electronics and Communication Engineering Department, Cairo University, Cairo 12613, Egypt;1. Department of Cardiovascular Surgery, Provincial Hospital Affiliated to Shandong University, Jinan, China;2. Ultrasound Department, Provincial Hospital Affiliated to Shandong University, Jinan, China;1. National School of Applied Sciences, IbnZohr University, Agadir 80000, Morocco;2. High School of Technology, IbnZohr University, Agadir 80000, Morocco |
| |
| Abstract: | In order to address Bergamo et al.’s attack, Xiao et al. proposed a key agreement protocol using chaotic maps. Han then presented three attacks on Xiao et al.’s protocol. To enhance the security of key agreement based on chaotic maps, Chang et al. proposed a new key agreement using passphrase, which works in clock synchronization environment. However, their protocol still has some issues: one is its passphrase is not easy to remember and much longer than password; the second one is it cannot resist guessing attack if the constructed passphrase is easy to remember and also has already existed in some rational dictionaries; the third one is it cannot work without clock synchronization. In this paper, we will present two different key agreement protocols, which can resist guessing attack. The first one works in clock synchronization environment. The second one can work without clock synchronization. They both use authenticated password for secure communications. The protocols are secure against replaying attacks and a shared session key can be established. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
