Strengthening Password-Based Authentication Protocols Against Online Dictionary Attacks

An emerging direction for authenticating people is the adoption of biometric authentication systems. Biometric credentials are becoming increasingly popular as a means of authenticating people due to the wide range of advantages that they provide with respect to classical authentication methods (e.g., password-based authentication). The most characteristic feature of this authentication method is the naturally strong bond between a user and her biometric credentials. This very same advantageous property, however, raises serious security and privacy concerns in case the biometric trait gets compromised. In this article, we present the most challenging issues that need to be taken into consideration when designing secure and privacy-preserving biometric authentication protocols. More precisely, we describe the main threats against privacy-preserving biometric authentication systems and give directions on possible countermeasures in order to design secure and privacy-preserving biometric authentication protocols.

Download Full-text

Automatic Verification of Password-Based Authentication Protocols Using Smart Card

2011 International Conference of Information Technology, Computer Engineering and Management Sciences ◽

10.1109/icm.2011.286 ◽

2011 ◽

Cited By ~ 1

Author(s):

Bin Hu ◽

Qi Xie ◽

Yang Li

Keyword(s):

Smart Card ◽

Automatic Verification ◽

Authentication Protocols ◽

Password Based Authentication

Download Full-text

Comprehensive Analysis of Broadcast Authentication protocols in Wireless Sensor Networks

Journal of Computer Science and Information Technology ◽

10.15640/jcsit.v2n3-4a6 ◽

2014 ◽

Vol 2 (3 & 4) ◽

Author(s):

Masoum Farahmandian ◽

Mohammad Masdari ◽

Vahid Farahmandian

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Comprehensive Analysis ◽

Wireless Sensor ◽

Authentication Protocols ◽

Broadcast Authentication

Download Full-text

Password-Based Authentication Protocol for Secret-Sharing-Based Multiparty Computation

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e101.a.51 ◽

2018 ◽

Vol E101.A (1) ◽

pp. 51-63 ◽

Cited By ~ 1

Author(s):

Ryo KIKUCHI ◽

Koji CHIDA ◽

Dai IKARASHI ◽

Koki HAMADA

Keyword(s):

Secret Sharing ◽

Authentication Protocol ◽

Multiparty Computation ◽

Password Based Authentication

Download Full-text

Security Analysis of Wireless Authentication Protocols

International Journal of Sensors Wireless Communications and Control ◽

10.2174/2210327908666180806112157 ◽

2019 ◽

Vol 9 (2) ◽

pp. 247-252 ◽

Cited By ~ 1

Author(s):

Ashish Joshi ◽

Amar Kumar Mohapatra

Keyword(s):

Execution Time ◽

Communication Systems ◽

Security Analysis ◽

Cryptographic Protocols ◽

Command Line ◽

Time Analysis ◽

Authentication Protocols ◽

Replay Attack ◽

Peer Communication ◽

Digital Communication Systems

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Download Full-text

An Improved Fuzzy Vector Signature with Reusability

Applied Sciences ◽

10.3390/app10207141 ◽

2020 ◽

Vol 10 (20) ◽

pp. 7141

Author(s):

Ilhwan Lim ◽

Minhye Seo ◽

Dong Hoon Lee ◽

Jong Hwan Park

Keyword(s):

Sampling Method ◽

Performance Comparison ◽

Error Rates ◽

Efficiency Improvement ◽

Fuzzy Extractor ◽

Authentication Protocols ◽

Biometric Data ◽

Single User ◽

Helper Data ◽

Fuzzy Vector

Fuzzy vector signature (FVS) is a new primitive where a fuzzy (biometric) data w is used to generate a verification key (VKw), and, later, a distinct fuzzy (biometric) data w′ (as well as a message) is used to generate a signature (σw′). The primary feature of FVS is that the signature (σw′) can be verified under the verification key (VKw) only if w is close to w′ in a certain predefined distance. Recently, Seo et al. proposed an FVS scheme that was constructed (loosely) using a subset-based sampling method to reduce the size of helper data. However, their construction fails to provide the reusability property that requires that no adversary gains the information on fuzzy (biometric) data even if multiple verification keys and relevant signatures of a single user, which are all generated with correlated fuzzy (biometric) data, are exposed to the adversary. In this paper, we propose an improved FVS scheme which is proven to be reusable with respect to arbitrary correlated fuzzy (biometric) inputs. Our efficiency improvement is achieved by strictly applying the subset-based sampling method used before to build a fuzzy extractor by Canetti et al. and by slightly modifying the structure of the verification key. Our FVS scheme can still tolerate sub-linear error rates of input sources and also reduce the signing cost of a user by about half of the original FVS scheme. Finally, we present authentication protocols based on fuzzy extractor and FVS scheme and give performance comparison between them in terms of computation and transmission costs.

Download Full-text

Remote Quantum-Safe Authentication of Entities with Physical Unclonable Functions

Photonics ◽

10.3390/photonics8070289 ◽

2021 ◽

Vol 8 (7) ◽

pp. 289

Author(s):

Georgios M. Nikolopoulos

Keyword(s):

Authentication Protocol ◽

Authentication Protocols ◽

Photonic Networks ◽

Physical Unclonable Functions ◽

Quantum Protocols ◽

Open Question ◽

Standard Techniques

Physical unclonable functions have been shown to be a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All the related entity authentication protocols that have been discussed in the literature so far, either they are vulnerable to an emulation attack, or they are limited to short distances. Hence, quantum-safe remote entity authentication over large distances remains an open question. In the first part of this work, we discuss the requirements that an entity authentication protocol has to offer, to be useful for remote entity authentication in practice. Subsequently, we propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries. The proposed protocol relies on standard techniques, it is fully compatible with the infrastructure of existing and future photonic networks, and it can operate in parallel with other quantum protocols, including QKD protocols.

Download Full-text