Physical unclonable functions have been shown to be a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All the related authentication protocols that discussed in literature so far, either they are vulnerable an emulation attack, or limited short distances. Hence, quantum-safe remote over large distances remains open question. In first p...

Group communication systems are building tools for distributed and collaborative applications that often run in an insecure environment. Although necessary, basic security services such as data secrecy and data integrity are not sufficient for a secure group communication system. Entity authentication and access control services are needed to provide the application with a policy enforcement me...

Group Diie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message integrity. Over the years, several schemes have been ooered. However, no formal treatment for this cryptographic problem has ever been suggested. In this paper, we present a security model for this...

With the global deployment of portable communication systems and the ongoing developments in this area, one expects more and more sophisticated security features to be provided such as entity authentication, robust user identity confidentiality and non-repudiation services. Motivated by these new security requirements, this article analyzes the security of authentication protocols in several mo...

We address the problem of message authentication using the -calculus, which has been given an operational semantics in [2] that provides each sequential process of a system with its own local space of names. We exploit here that semantics and its localized names to guarantee by construction that a message has been generated by a given entity. Therefore, our proposal can be seen as a reference f...

We propose a way to abstract from various specifications of authentication and to obtain idealized protocols “secure by construction”. This feature enables us to prove that a cryptographic protocol is the correct implementation of the corresponding abstract protocol. Our proposal relies on the combination of two authentication primitives, proposed by the authors in [20, 18] to a simplified vers...

Today, digitalization decisively penetrates all the sides of the modern society. One of the key enablers to maintain this process secure is authentication. It covers many different areas of a hyper-connected world, including online payments, communications, access right management, etc. This work sheds light on the evolution of authentication systems towards Multi-Factor Authentication (MFA) st...

In pervasive computing environments (PCEs), privacy and security are two important but contradictory objectives. Users enjoy services provided in PCEs only after their privacy issues being sufficiently addressed. That is, users could not be tracked down for wherever they are and whatever they are doing. However, service providers always want to authenticate the users and make sure they are acce...

Two-factor authentication is increasingly demanded in the Internet of Things (IoT), especially those deployed in the critical infrastructure. However, resource and operational constraints of typical IoT devices are the key impediment, especially when the IoT device acts as a verifier. This paper proposes a novel authentication factor (namely, historical data) which, when combined with the conve...

We propose a way to abstract from various specifications of authentication and to obtain idealized protocols “secure by construction”. This feature enables us to prove that a cryptographic protocol is the correct implementation of the corresponding abstract protocol. Our proposal relies on the combination of two authentication primitives, proposed by the authors in [20, 18] to a simplified vers...