Password-Authenticated Key Exchange; Tight Reductions; Random Oracle
Abstract :
[en] We present a security reduction for the PAK protocol instantiated over Gap Diffie-Hellman Groups that is tighter than previously known reductions. We discuss the implications of our results for
concrete security. Our proof is the first to show that the PAK protocol can provide meaningful security guarantees for values of the parameters typical in today’s world.
Research center :
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
Disciplines :
Computer science
Author, co-author :
Lopez Becerra, José Miguel ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Iovino, Vincenzo ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Ostrev, Dimiter ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Sala, Petra ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Skrobot, Marjan ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
External co-authors :
yes
Language :
English
Title :
Tightly-Secure PAK(E)
Publication date :
02 December 2017
Event name :
16th International Conference on Cryptology And Network Security (CANS 2017)
Event organizer :
The Chinese University of Hong Kong, Hong Kong
Event place :
Hong Kong, China
Event date :
from 29-11-2017 to 02-12-2017
Audience :
International
Main work title :
Cryptology and Network Security
Publisher :
Springer
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
FnR Project :
FNR8293135 - A Theory Of Matching Sessions, 2014 (01/05/2015-30/04/2018) - Peter Y. A. Ryan
