Password-Authenticated Key Exchange; Tight Reductions; Random Oracle
Résumé :
[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.
Centre de recherche :
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
Disciplines :
Sciences informatiques
Auteur, co-auteur :
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)
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Tightly-Secure PAK(E)
Date de publication/diffusion :
02 décembre 2017
Nom de la manifestation :
16th International Conference on Cryptology And Network Security (CANS 2017)
Organisateur de la manifestation :
The Chinese University of Hong Kong, Hong Kong
Lieu de la manifestation :
Hong Kong, Chine
Date de la manifestation :
from 29-11-2017 to 02-12-2017
Manifestation à portée :
International
Titre de l'ouvrage principal :
Cryptology and Network Security
Maison d'édition :
Springer
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Projet FnR :
FNR8293135 - A Theory Of Matching Sessions, 2014 (01/05/2015-30/04/2018) - Peter Y. A. Ryan
