scholarly journals A Secure IoT-Based Mutual Authentication for Healthcare Applications in Wireless Sensor Networks Using ECC

2021 ◽  
Vol 16 (2) ◽  
pp. 21-48
Author(s):  
Deepti Singh ◽  
Bijendra Kumar ◽  
Samayveer Singh ◽  
Satish Chand
Keyword(s):  
Sensor Networks ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Performance Comparison ◽  
Sensor Nodes ◽  
Healthcare Applications ◽  
Report Generation ◽  
Active Attacks

The role of wireless medical sensor networks (WMSNs) is very significant in healthcare applications of IoT. Online report generation and sharing the reports reduce the time and make the treatment of patients very fast. Here, the safety of patient data plays a crucial role. As there is a restriction of resources in sensor nodes, the design of authentication scheme for WMSNs is not an easy task in healthcare applications. Healthcare professionals are using their mobile to collect data from patients' bodies. To use WMSNs in healthcare applications, cryptanalysis of Li et al. is done and found that it suffers from various attacks. Hence, a new efficient privacy-preserving user authenticated scheme using elliptic curve cryptography (ECC) is proposed. The security analysis of scheme is performed using random oracle model, in addition to BAN logic. AVISPA is used for simulation to prove that the proposed scheme can resist passive and active attacks. Finally, the performance comparison of schemes shows that the proposed scheme performs better.

scholarly journals An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity

2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Yousheng Zhou ◽  
Junfeng Zhou ◽  
Feng Wang ◽  
Feng Guo
Keyword(s):  
Key Management ◽  
Chaotic Map ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Authentication Scheme ◽  
Session Key ◽  
The Real ◽  
Shared Key

A chaotic map-based mutual authentication scheme with strong anonymity is proposed in this paper, in which the real identity of the user is encrypted with a shared key between the user and the trusted server. Only the trusted server can determine the real identity of a user during the authentication, and any other entities including other users of the system get nothing about the user’s real identity. In addition, the shared key of encryption can be easily computed by the user and trusted server using the Chebyshev map without additional burdensome key management. Once the partnered two users are authenticated by the trusted server, they can easily proceed with the agreement of the session key. Formal security analysis demonstrates that the proposed scheme is secure under the random oracle model.

A Secure and Robust Three-Factor Based Authentication Scheme Using RSA Cryptosystem

2017 ◽  
Vol 13 (1) ◽  
pp. 74-84 ◽  
Author(s):  
Rifaqat Ali ◽  
Arup Kumar Pal
Keyword(s):  
User Authentication ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Performance Comparison ◽  
Authentication Scheme ◽  
Authentication Protocols ◽  
Session Key ◽  
Rsa Cryptosystem ◽  
Three Factor

In remote user authentication, a server confirms the authenticity of a user via unreliable channel. Several authentication protocols are devised in the literature relied on the identity, password and biometric of a user. But, most of the authentication protocols are either computationally expensive or not-secure from several kinds of malicious threats. In this document, the authors have suggested a secure and robust three-factor (such as password, smartcard and biometric) based authentication scheme by using RSA cryptosystem. The proposed protocol is validated through BAN logic. Then, formal security analysis using random oracle model shows that the identity, password, biometric and session key are highly secure from an adversary. Besides, the informal security analysis of our protocol proves that it withstands to several kinds of malicious attacks. In addition, performance comparison of presented scheme with respect to other schemes is comparatively suitable in the context of communication and computation costs.

scholarly journals Privacy-Preserving Data Aggregation Protocol for Fog Computing-Assisted Vehicle-to-Infrastructure Scenario

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Yanan Chen ◽  
Zhenyu Lu ◽  
Hu Xiong ◽  
Weixiang Xu
Keyword(s):  
Fog Computing ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Privacy Preserving ◽  
Performance Comparison ◽  
Communication Overhead ◽  
Time Data ◽  
Moving Vehicles ◽  
Vehicle To Infrastructure

Vehicle-to-infrastructure (V2I) communication enables moving vehicles to upload real-time data about road surface situation to the Internet via fixed roadside units (RSU). Thanks to the resource restriction of mobile vehicles, fog computation-enhanced V2I communication scenario has received increasing attention recently. However, how to aggregate the sensed data from vehicles securely and efficiently still remains open to the V2I communication scenario. In this paper, a light-weight and anonymous aggregation protocol is proposed for the fog computing-based V2I communication scenario. With the proposed protocol, the data collected by the vehicles can be efficiently obtained by the RSU in a privacy-preserving manner. Particularly, we first suggest a certificateless aggregate signcryption (CL-A-SC) scheme and prove its security in the random oracle model. The suggested CL-A-SC scheme, which is of independent interest, can achieve the merits of certificateless cryptography and signcryption scheme simultaneously. Then we put forward the anonymous aggregation protocol for V2I communication scenario as one extension of the suggested CL-A-SC scheme. Security analysis demonstrates that the proposed aggregation protocol achieves desirable security properties. The performance comparison shows that the proposed protocol significantly reduces the computation and communication overhead compared with the up-to-date protocols in this field.

Hierarchical Wireless Networks of Body Sensor Networks for Healthcare Applications

2010 ◽  
pp. 65-86 ◽  
Author(s):  
José A. Afonso ◽  
Pedro Macedo ◽  
Luis A. Rocha ◽  
José H. Correia
Keyword(s):  
Sensor Networks ◽  
Ieee 802.15.4 ◽  
Base Station ◽  
Mac Protocols ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Body Sensor Networks ◽  
Healthcare Applications ◽  
Data Intensive ◽  
The One

Conventional wired body sensor networks have been used in hospitals over the last decade; however, the tethered operation restricts the mobility of the patients. In the scenario considered in this chapter, the signals collected from the patients’ bodies are wirelessly transmitted to a base station, and then delivered to a remote diagnosis centre through a communication infrastructure, enabling full mobility of the patient in the coverage area of the wireless network. Healthcare applications require the network to satisfy demanding requirements in terms of quality of service (QoS) and, at the same time, minimize the energy consumption of the sensor nodes. The traffic generated by data-intensive healthcare applications may lead to frequent collisions between sensor nodes and the consequent loss of data, if conventional MAC protocols for wireless sensor networks are used. Therefore, this chapter presents LPRT and CCMAC, two MAC protocols that intend to satisfy the QoS requirements of these applications, but differ in the wireless topology used. Experimental results for an implementation of the LPRT using an IEEE 802.15.4 compliant wireless sensor platform are presented, as well as simulation results comparing the performance of direct communication (between wireless body sensor nodes and the base station) with two other approaches relying on a cluster-based topology (similar to the one proposed by the authors of LEACH), which demonstrate the benefits of using a cluster-based topology on wireless healthcare applications.

An efficient certificateless multi-receiver threshold decryption scheme

2019 ◽  
Vol 53 (1-2) ◽  
pp. 67-84 ◽  
Author(s):  
Ronghai Gao ◽  
Jiwen Zeng ◽  
Lunzhi Deng
Keyword(s):  
Security Analysis ◽  
Mobile Network ◽  
Random Oracle Model ◽  
Bilinear Pairings ◽  
Random Oracle ◽  
Bilinear Pairing ◽  
Public And Private ◽  
The Public ◽  
Public Keys ◽  
Threshold Decryption

Threshold decryption allows only quorum cooperate users to decrypt ciphertext encrypted under a public key. However, such threshold decryption scheme cannot be applied well in this situation where all users have their public and private key pairs, but do not share any private keys corresponding to the public keys, such as mobile network featured with dynamic character. The direct way to achieve threshold decryption in this case is to divide the message into several pieces and then encrypt these pieces with the public keys of different users. However, this is very inefficient. Multireceiver threshold decryption scheme that could be applied efficiently in the above situation. Recently, some certificateless (ID-based) multireceiver threshold decryption (signcryption) schemes are introduced. But the bilinear pairings are used in most of the existing schemes. In this paper, we propose an efficient certificateless threshold decryption scheme using elliptic curve cryptography (ECC) without bilinear pairing. Performance analysis shows that the proposed scheme has lower computation cost than existing some threshold decryption schemes in both encryption and decryption process. Security analysis shows that our scheme is IND-CCA secure, and no one outside of selected receivers can disclose receivers identities, against the adversaries defined in CL-PKC system under the random oracle model.

Short Online/Off-line Signature Scheme for Wireless Sensor Networks

2015 ◽  
Vol 9 (1) ◽  
pp. 47-61
Author(s):  
Anser Ghazzaal Ali Alquraishee ◽  
Jayaprakash Kar ◽  
Naomie Salim
Keyword(s):  
Computational Cost ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Signature Scheme ◽  
Diffie Hellman ◽  
Two Phases ◽  
Chosen Message Attack

This article proposes a novel construction of short Online/Off-line signature scheme with provable security in the random oracle model for wireless sensor network (WSN). Security of the proposed scheme relies on k-CAA Problem as well as Computational Diffie-Hellman problem and is resistant against chosen message attack. The scheme is suited for broadcast authentication and integrity of message exchanging between the sensor nodes. The process of generation of the signature is carried out in two phases online and off-line. The heavy computation is performed in off-line phase, i.e the base station. The actual signature will be generated in the sensor nodes. The authors assume that the online phase is more efficient. Here they have evaluated the size of the signature with respect to the size of the user's public key and compare with some current schemes. Also, the authors have evaluated the computational cost and time which shows the scheme is most suited to implement on sensor node.

scholarly journals An Improved Anonymous Authentication Protocol for Wearable Health Monitoring Systems

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jiaqing Mo ◽  
Wei Shen ◽  
Weisheng Pan
Keyword(s):  
Health Monitoring ◽  
Denial Of Service ◽  
Security Analysis ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Authentication Protocol ◽  
Wireless Channel ◽  
Formal Proofs ◽  
Insider Attack ◽  
Quadratic Residues

Wearable health monitoring system (WHMS), which helps medical professionals to collect patients’ healthcare data and provides diagnosis via mobile devices, has become increasingly popular thanks to the significant advances in the wireless sensor network. Because health data are privacy-related, they should be protected from illegal access when transmitted over a public wireless channel. Recently, Jiang et al. presented a two-factor authentication protocol on quadratic residues with fuzzy verifier for WHMS. However, we observe that their scheme is vulnerable to known session special temporary information (KSSTI) attack, privileged insider attack, and denial-of-service (DoS) attack. To defeat these weaknesses, we propose an improved two-factor authentication and key agreement scheme for WHMS. Through rigorous formal proofs under the random oracle model and comprehensive informal security analysis, we demonstrate that the improved scheme overcomes the disadvantages of Jiang et al.’s protocol and withstands possible known attacks. In addition, comparisons with several relevant protocols show that the proposed scheme achieves more security features and has suitable efficiency. Thus, our scheme is a reasonable authentication solution for WHMS.

scholarly journals Improving an Anonymous and Provably Secure Authentication Protocol for a Mobile User

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Jongho Moon ◽  
Youngsook Lee ◽  
Jiye Kim ◽  
Dongho Won
Keyword(s):  
Chaotic Map ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Random Oracle ◽  
Authentication Protocol ◽  
Mobile User ◽  
Internet Security ◽  
Computationally Efficient ◽  
Fuzzy Extractor ◽  
On Line

Recently many authentication protocols using an extended chaotic map were suggested for a mobile user. Many researchers demonstrated that authentication protocol needs to provide key agreement, mutual authentication, and user anonymity between mobile user and server and resilience to many possible attacks. In this paper, we cautiously analyzed chaotic-map-based authentication scheme and proved that it is still insecure to off-line identity guessing, user and server impersonation, and on-line identity guessing attacks. To address these vulnerabilities, we proposed an improved protocol based on an extended chaotic map and a fuzzy extractor. We proved the security of the proposed protocol using a random oracle and AVISPA (Automated Validation of Internet Security Protocols and Applications) tool. Furthermore, we present an informal security analysis to make sure that the improved protocol is invulnerable to possible attacks. The proposed protocol is also computationally efficient when compared to other previous protocols.

scholarly journals Performance Comparison of Homogeneous and Heterogeneous 3D Wireless Sensor Networks

2017 ◽  
pp. 32-37 ◽  
Author(s):  
Ranjana Thalore ◽  
Partha Pratim Bhattacharya ◽  
Manish Kumar Jha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Performance Comparison ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Medical Monitoring ◽  
3 Dimensional ◽  
Recent Developments ◽  
Efficient Data ◽  
Battery Energy

Recent developments in wireless sensor networks include their applications in safety, medical monitoring, environment monitoring and many more. Limited battery energy and efficient data delivery are most considered constraints for sensor nodes. Depletion of node battery ceases functioning of the node. The network lifetime can be enhanced with the help of Multi-Layer protocol (ML-MAC). This paper presents a practical approach including 3-dimensional deployment of sensor nodes and analyzes two different types of networks – homogeneous and heterogeneous WSNs. To analyze various QoS parameters, two types of nodes are considered in a heterogeneous network. The performance of both the networks is compared through simulations. The results show that ML-MAC performs better for a 3D heterogeneous WSNs.

scholarly journals Efficient Certificateless Conditional Privacy-Preserving Authentication Scheme in VANETs

2019 ◽  
Vol 2019 ◽  
pp. 1-19 ◽  
Author(s):  
Yang Ming ◽  
Hongliang Cheng
Keyword(s):  
Traffic Safety ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Security Analysis ◽  
Real Life ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Privacy Preserving ◽  
Bilinear Pairing ◽  
Security And Privacy

Vehicular ad hoc networks (VANETs) are an increasing important paradigm for greatly enhancing roadway system efficiency and traffic safety. To widely deploy VANETs in real life, it is critical to deal with the security and privacy issues in VANETs. In this paper, we propose a certificateless conditional privacy preserving authentication (CCPPA) scheme based on certificateless cryptography and elliptic curve cryptography for secure vehicle-to-infrastructure communication in VANETs. In the proposed scheme, a roadside unit (RSU) can simultaneously verify plenty of received messages such that the total verification time may be sharply decreased. Furthermore, the security analysis indicates that the proposed scheme is provably secure in the random oracle model and fulfills all the requirements on security and privacy. To further improve efficiency, both map-to-point hash operation and bilinear pairing operation are not employed. Compared with previous CCPPA schemes, the proposed scheme prominently cuts down computation delay of message signing and verification by 66.9%–85.5% and 91.8%–93.4%, respectively, and reduces communication cost by 44.4%. Extensive simulations show that the proposed scheme is practicable and achieves prominent performances of very little average message delay and average message loss ratio and thus is appropriate for realistic applications.

Sign in / Sign up

Export Citation Format

Share Document