<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JIS</journal-id><journal-title-group><journal-title>Journal of Information Security</journal-title></journal-title-group><issn pub-type="epub">2153-1234</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jis.2017.81006</article-id><article-id pub-id-type="publisher-id">JIS-73527</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Authenticated Privacy Preserving Pairing-Based Scheme for Remote Health Monitoring Systems
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Kambombo</surname><given-names>Mtonga</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Eun</surname><given-names>Jun Yoon</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Hyun</surname><given-names>Sung Kim</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Department of Cyber Security, Kyungil University, Daegu, South Korea</addr-line></aff><aff id="aff1"><addr-line>Mathematical Sciences Department, University of Malawi-Chancellor College, Zomba, Malawi</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>kmtonga@cc.ac.mw(KM)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>07</day><month>12</month><year>2016</year></pub-date><volume>08</volume><issue>01</issue><fpage>75</fpage><lpage>90</lpage><history><date date-type="received"><day>November</day>	<month>21,</month>	<year>2016</year></date><date date-type="rev-recd"><day>Accepted:</day>	<month>January</month>	<year>14,</year>	</date><date date-type="accepted"><day>January</day>	<month>17,</month>	<year>2017</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The digitization of patient health information has brought many benefits and challenges for both the patients and physicians. However, security and privacy preservation have remained important challenges for remote health monitoring systems. Since a patient’s health information is sensitive and the communication channel (i.e. the Internet) is insecure, it is important to protect them against unauthorized entities. Otherwise, failure to do so will not only lead to compromise of a patient’s privacy, but will also put his/her life at risk. How to provide for confidentiality, patient anonymity and un-traceability, access control to a patient’s health information and even key exchange between a patient and her physician are critical issues that need to be addressed if a wider adoption of remote health monitoring systems is to be realized. This paper proposes an authenticated privacy preserving pairing-based scheme for remote health monitoring systems. The scheme is based on the concepts of bilinear paring, identity-based cryptography and non-interactive identity-based key agreement protocol. The scheme also incorporates an efficient batch signature verification scheme to reduce computation cost during multiple simultaneous signature verifications.
 
</p></abstract><kwd-group><kwd>Remote Healthcare</kwd><kwd> Bilinear Pairing</kwd><kwd> Privacy Preservation</kwd><kwd> Mutual Authentication</kwd><kwd> ID-Based Cryptography</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The traditional healthcare systems are plagued by many problems and challenges. These problems and challenges include: diagnoses being written illegibly on paper, physicians not being able to easily access patient health information (PHI), and limitations on time, space, and personnel for monitoring patients. Similarly, the current health care systems―structured and optimized for reacting to crisis and managing illness―are facing new challenges: a rapidly growing population of elderly and rising healthcare spending [<xref ref-type="bibr" rid="scirp.73527-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref2">2</xref>] . As more and more people enter an elder age, the risk of developing certain chronic and debilitating diseases is significantly higher [<xref ref-type="bibr" rid="scirp.73527-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref4">4</xref>] . Furthermore, if aged populations prefer to live alone they do require long-term monitoring for better independent life [<xref ref-type="bibr" rid="scirp.73527-ref5">5</xref>] . Clearly, innovative strategies are needed to tackle the existing problems and to cater to the healthcare needs of an aging population in addition to sustaining the trend towards an independent lifestyle focusing on personalized non-hospital based care [<xref ref-type="bibr" rid="scirp.73527-ref6">6</xref>] . With recent advancements in telecommunication technology however, opportunities exist to improve the current state of the healthcare systems to minimize some of these problems and provide more personalized service [<xref ref-type="bibr" rid="scirp.73527-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref8">8</xref>] .</p><p>The recent technological advances in sensors, low-power integrated circuits, and wireless communications have enabled the design of low-cost, miniature, lightweight, and intelligent physiological sensor nodes. These sensors capable of sensing, processing, and communicating one or more vital signs, can be seamlessly integrated into wireless personal or body area networks (WPANs or WBANs) for health monitoring [<xref ref-type="bibr" rid="scirp.73527-ref9">9</xref>] . A WBAN contains a number of portable, miniaturized, and autonomous sensor nodes (in-body or/and on-body nodes) that monitors patients under natural physiological states without constraining their normal activities. The gateway (e.g. PC or mobile phone) of the WBAN is responsible for data collection, processing and overall WBAN management. These networks promise to revolutionize healthcare by allowing inexpensive, non-invasive continuous health monitoring with almost real-time updates of medical records via the Internet. Remote health monitoring systems typically collect patient readings and then transmit them to a remote server for storage and later examination by the healthcare professionals. However, the different usage scenarios of remote health monitoring systems ranging from pre-hospital, in-hospital, ambulatory and in-home monitoring have resulted in diverse security and privacy concerns [<xref ref-type="bibr" rid="scirp.73527-ref10">10</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref11">11</xref>] . Also, due to the sensitive nature of some of the remotely electronically collected PHI combined with the insecure nature of the communication channels, there is need to prevent unauthorized access to and use of the PHI by both active and passive adversaries. Otherwise, failure to do so will not only put a patient’s privacy in jeopardy, but also her life will be at risk. Hence there is need for new schemes to protect against privacy violation in remote health monitoring environments.</p><p>Many security protocols to enhance privacy and security in remote health monitoring systems have been put forward by researchers. Huang et al. [<xref ref-type="bibr" rid="scirp.73527-ref12">12</xref>] proposed an identity-based authentication and context privacy preservation scheme in wireless health monitoring system. They adopted identity-based encryption to protect the confidentiality of PHI. However, Huang et al.’s scheme does not achieve patient identity privacy and is also prone to password guessing attacks on the physician’s side [<xref ref-type="bibr" rid="scirp.73527-ref13">13</xref>] . Layouni et al. [<xref ref-type="bibr" rid="scirp.73527-ref14">14</xref>] proposed a privacy protection protocol for remote monitoring of medical care. They applied symmetric encryption and RSA algorithm to complete the encryption and authentication for PHI. Hasque et al. [<xref ref-type="bibr" rid="scirp.73527-ref15">15</xref>] proposed a secure u-healthcare sensor networks using public key based scheme. In their scheme, they adopted asymmetric encryption for confidentiality protection. Yang et al. [<xref ref-type="bibr" rid="scirp.73527-ref16">16</xref>] presented a password-based authentication scheme for healthcare delivery systems. The rationale behind their scheme is to allow patients to authenticate to healthcare providers using long- term short passwords. Sadly, password-based authentication systems are vulnerable to dictionary attacks. The U.S. government has also established stringent regulations to ensure that the security and privacy of PHI is properly protected [<xref ref-type="bibr" rid="scirp.73527-ref17">17</xref>] . Clearly, the issues of patient identity and data privacy have not been fully explored in the existing literature.</p><p>In this paper an authenticated privacy preserving paring-based scheme for wireless health monitoring systems is proposed. The proposed scheme consists of three parties (see <xref ref-type="fig" rid="fig1">Figure 1</xref> below), namely; the gateway of patient WBAN, the Electronic Health Record (EHR) database in Health Monitoring Server (HMS) and the physician. In the proposed scheme, all communications between the gateway and EHR, EHR and physician and physician with gateway are carried out over an insecure channel (i.e. the Internet). The HMS plays the role of the registration server and system parameter generator (or trusted authority) while the EHR acts as the authentication server. Identity-based cryptography (IBC) encryption is adopted to ensure the secure transmission, receiving, storing and access of PHI. This ensures integrity of PHI which in turn is crucial for accurate diagnoses of a patient by her respective physician. The scheme allows the patient and her physician to establish a secure communication channel via an established session key shared only between the two parties. This is possible because of the concept of non-interactive identity-based key agreement adopted. The analysis will show that the scheme provides confidentiality of a patient’s health information, explicit mutual authentication between the patient and her physician, patient anonymity and un-traceability, patient revocation, session key secrecy and resistance against replay attacks.</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> System environment</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-7800395x2.png"/></fig><p>The rest of the paper is organized as follows: in Section 2, we describe some of the preliminary work and notations that are used throughout this paper. In Section 3, a discussion of the proposed scheme including system initialization, Registration of parties and health information transfer is presented. Section 4, presents an analysis that proves that our scheme is efficient and that it achieves many desirable security and privacy preserving properties. Section 5 shows that the proposed scheme has a better performance than Huang et al. and Layouni et al.’s schemes by providing a comparison among the three. Finally, a conclusion is presented in Section 6.</p></sec><sec id="s2"><title>2. Preliminaries</title><p>This section briefly reviews bilinear pairings, the Bilinear Diffie-Hellman problem and the original non-interactive identity-based key agreement protocol. Further, the threat model and notations used throughout the remainder of the paper are introduced.</p><sec id="s2_1"><title>2.1. Notations</title><p><xref ref-type="table" rid="table1">Table 1</xref> below presents the notations used throughout the remainder of the paper.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Notations</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Notation</th><th align="center" valign="middle" >Meaning</th></tr></thead><tr><td align="center" valign="middle" >PT<sub>i</sub></td><td align="center" valign="middle" >Patient i</td></tr><tr><td align="center" valign="middle" >D<sub>l</sub></td><td align="center" valign="middle" >Physician l i.e. doctor or nurse</td></tr><tr><td align="center" valign="middle" >s</td><td align="center" valign="middle" >Master secret key for TA</td></tr><tr><td align="center" valign="middle" >P<sub>pub</sub></td><td align="center" valign="middle" >System public key</td></tr><tr><td align="center" valign="middle" >d<sub>x</sub></td><td align="center" valign="middle" >Private key for entity x</td></tr><tr><td align="center" valign="middle" >Q<sub>x</sub></td><td align="center" valign="middle" >Public key for entity x</td></tr><tr><td align="center" valign="middle" >id<sub>x</sub></td><td align="center" valign="middle" >Identity for entity x</td></tr><tr><td align="center" valign="middle" >PIDPT<sub>i</sub></td><td align="center" valign="middle" >Set of pseudo-IDs for PT<sub>i</sub></td></tr><tr><td align="center" valign="middle" >pid<sub>j</sub></td><td align="center" valign="middle" >j<sup>th</sup> pseudo-ID for PT<sub>i</sub></td></tr><tr><td align="center" valign="middle" >PUBPT<sub>i</sub></td><td align="center" valign="middle" >Set of public keys for PT<sub>i</sub></td></tr><tr><td align="center" valign="middle" >PRIPT<sub>i</sub></td><td align="center" valign="middle" >Set of private keys for PT<sub>i</sub></td></tr><tr><td align="center" valign="middle" >SKi-l</td><td align="center" valign="middle" >Session key shared between PT<sub>i</sub> and D<sub>l</sub></td></tr><tr><td align="center" valign="middle" >H<sub>1</sub> (∙)</td><td align="center" valign="middle" >Hash function; <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x3.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >H<sub>2</sub> (∙)</td><td align="center" valign="middle" >Hash function; <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x4.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >T<sub>x</sub></td><td align="center" valign="middle" >Time stamp generated by entity x</td></tr><tr><td align="center" valign="middle" >&#234;</td><td align="center" valign="middle" >Bilinear map; <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x5.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >||</td><td align="center" valign="middle" >Concatenation</td></tr></tbody></table></table-wrap></sec><sec id="s2_2"><title>2.2. Bilinearity</title><p>Let G<sub>1</sub> be an additive group of prime order q and G<sub>2</sub> be a multiplicative cyclic group of the same order. In reality, G<sub>1</sub> is a subgroup of points on an elliptic curve over <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x6.png" xlink:type="simple"/></inline-formula> and 𝐺<sub>2</sub> is a subgroup of the multiplicative group of a finite field <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x7.png" xlink:type="simple"/></inline-formula> for some<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x8.png" xlink:type="simple"/></inline-formula>. Let 𝑃 denote a generator of G<sub>1</sub>. Then, there exists an efficient computable bilinear map <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x9.png" xlink:type="simple"/></inline-formula> which has the following properties [<xref ref-type="bibr" rid="scirp.73527-ref18">18</xref>] :</p><p> Bilinearity: Given P and Q in G<sub>1</sub> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x10.png" xlink:type="simple"/></inline-formula>, we have<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x11.png" xlink:type="simple"/></inline-formula>.</p><p> Non-degeneracy:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x12.png" xlink:type="simple"/></inline-formula>.</p><p> Computability: There exists an efficient algorithm to compute <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x13.png" xlink:type="simple"/></inline-formula> for any<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x14.png" xlink:type="simple"/></inline-formula>.</p></sec><sec id="s2_3"><title>2.3. The Bilinear Diffie-Hellman Assumption</title><p>The Bilinear Diffie-Hellman (BDH) problem is to compute <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x15.png" xlink:type="simple"/></inline-formula> given <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x16.png" xlink:type="simple"/></inline-formula> and elements <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x17.png" xlink:type="simple"/></inline-formula> for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x18.png" xlink:type="simple"/></inline-formula>. Computing such a problem is assumed to be hard on<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x19.png" xlink:type="simple"/></inline-formula>.</p></sec><sec id="s2_4"><title>2.4. Computational Diffie-Hellman Problem</title><p>The CDH problem is given <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x20.png" xlink:type="simple"/></inline-formula> for any <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x21.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x22.png" xlink:type="simple"/></inline-formula>, computting abP is assumed hard.</p></sec><sec id="s2_5"><title>2.5. Non-Interactive Identity-Based Key Agreement</title><p>For non-interactive identity-based key agreement protocol, central authority first generates two cyclic groups G<sub>1</sub> and G<sub>2</sub> and the bilinear map <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula> to setup the parameters for an identity-based public key system. The central authority also chooses a cryptographic collision free hash function (∙): <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x24.png" xlink:type="simple"/></inline-formula>. It then chooses a secret key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x25.png" xlink:type="simple"/></inline-formula> and computes corresponding public key<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x26.png" xlink:type="simple"/></inline-formula>, where 𝑃 is a generator of G<sub>1</sub>. Lastly it publishes public parameters<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x27.png" xlink:type="simple"/></inline-formula>. For registered party i, the central authority computes a private key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x28.png" xlink:type="simple"/></inline-formula> and sends it via a secure channel [<xref ref-type="bibr" rid="scirp.73527-ref19">19</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref20">20</xref>] .</p><p>With such a setup, any two clients of the same central authority can compute shared key using only the identity of the other participant and their own private key. For two clients with identities, id<sub>1</sub> and id<sub>2</sub>, the shared key is given by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x29.png" xlink:type="simple"/></inline-formula> which party id<sub>1</sub> computes as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x30.png" xlink:type="simple"/></inline-formula> and id<sub>2</sub> computes<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x31.png" xlink:type="simple"/></inline-formula>.</p><p>Clearly,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x32.png" xlink:type="simple"/></inline-formula>.</p></sec></sec><sec id="s3"><title>3. Proposed Authenticated Privacy Preserving Scheme</title><p>In this section the proposed authenticated privacy preserving paring-based scheme for remote health monitoring systems is presented. The existence of a properly setup and functioning patient WBAN with the gateway of the WBAN responsible for collecting data from the biosensors and analyzing it is presumed. Based on the analysis, the gateway (equipped with a wireless Ethernet adapter so as to communicate with standard wireless router/switch) sends a summary report about the patient’s condition to the health monitoring server periodically. However, in case the analysis indicates a sudden health deterioration, or a condition that requires immediate attention, it is required that the gateway automatically trigger an emergency signal and send an immediate notification to the health monitoring server so that immediate necessary action can be taken to help the patient. The scheme consists of three parties, namely; the gateway of a patient’s WBAN, EHR database in HMS and the physician. Note: from here forth, we refer to a gateway of a patient’s WBAN simply as patient for convenience. In the proposed scheme, the HMS plays the role of the registration server and system parameter generator (or trusted authority) while the EHR acts as the authentication server. IBC-encryption is adopted to ensure the secure transmission, receiving, storing and access of PHI. This ensures integrity of PHI which in turn is crucial for accurate diagnoses of a patient by her respective physician. To achieve patient anonymity and un-traceability, privacy preserving technique based on pseudonyms is adopted. These pseudonyms are issued to the patient via a smartcard by trusted authority upon successful registration.</p><p>To aid authentication of patients and physicians by EHR, both patients and physicians are required to attach a signature to the message sent to EHR which can be successfully validated by EHR. To reduce computation overhead for EHR during signature validation process, an efficient batch signature verification scheme in which the EHR can simultaneously verify multiple received signatures is adopted [<xref ref-type="bibr" rid="scirp.73527-ref21">21</xref>] . The proposed scheme allows the patient and her physician to establish a secure communication channel via an established session key shared only between the two parties. This is possible because of the concept of non- interactive identity-based key agreement which has been adopted. The scheme also allows revocation of patients. This means that in cases of death, service subscription expiration period or upon request by the patient, the trusted authority can easily terminate service provision to the particular patient. The scheme consists of three main phases: system initialization, registration and health information exchange among patient, EHR and physician. First, a discussion of the threat model followed by a summary of notations and then we discuss the phases of our scheme.</p><sec id="s3_1"><title>3.1. Privacy Preserving Properties of the Scheme</title><p>There are many threats to a patient’s privacy and security in remote health monitoring systems. Some of these threats include: data breach by insiders (i.e. authorized EHR users or staff of the EHR organization), insider curiosity, accidental disclosure and unauthorized intrusion of network system by outsiders (i.e. third parties who act without authorization e.g. hackers) [<xref ref-type="bibr" rid="scirp.73527-ref22">22</xref>] . The aim of the proposed scheme is to enhance patient data and identity privacy against both insiders and outsiders. Below is a brief discussion of some of the security and privacy properties of the scheme and why they are important to a patient’s data security and identity privacy in remote health monitoring systems.</p><sec id="s3_1_1"><title>3.1.1. Confidentiality</title><p>In remote health monitoring systems, the disclosure of PHI to unauthorized persons is a serious security and privacy threat. This is because some of PHI can be sensitive. Hence once accessed, such data can be subjected to different misdemeanors such as fraudulent insurance claims by adversaries. In recent past there have been incidents where PHI was disclosed to external parties [<xref ref-type="bibr" rid="scirp.73527-ref23">23</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref24">24</xref>] .</p></sec><sec id="s3_1_2"><title>3.1.2. Anonymity and Untraceability</title><p>Among common privacy requirements, identity and location privacy, i.e. preventing unauthorized parties from learning one’s identity and current or past locations, are of paramount importance [<xref ref-type="bibr" rid="scirp.73527-ref25">25</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref26">26</xref>] [<xref ref-type="bibr" rid="scirp.73527-ref27">27</xref>] . The recent expansion of electronic and mobile healthcare systems has resulted in an increased demand for patient anonymity. This is because adversaries are now more capable of breaching network systems and achieve unauthorized access to PHI. For example, hackers may intrude into a hospital’s network to access PHI or render the system inoperable. Hence patient anonymity and un-traceability would prove vital in such scenarios.</p></sec></sec><sec id="s3_2"><title>3.2. System Initialization</title><p>Similar to other identity-based schemes, the proposed one also requires a private key generator (PKG). In the proposed scheme HMS acts as PKG. To initialize the system, HMS runs the following steps. Let G<sub>1</sub> be an additive cyclic group of prime order q, and G<sub>2</sub> be multiplicative cyclic group of same order. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula> be a bilinear map and 𝑃 be an arbitrary generator of G<sub>1</sub>. HMS then chooses a random number <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula> as the master secret key and computes the public key<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula>. It also chooses two secure collision free cryptographic hash functions <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x37.png" xlink:type="simple"/></inline-formula>. It further computes the public key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x38.png" xlink:type="simple"/></inline-formula> and corresponding private key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x39.png" xlink:type="simple"/></inline-formula> for EHR. The key pair <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x40.png" xlink:type="simple"/></inline-formula> is then sent to EHR via a secure channel (e.g. Transport Layer Security Protocol). HMS then publishes the public system parameters as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x33.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x40.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x41.png" xlink:type="simple"/></inline-formula> and keeps the master secret key s, secret.</p></sec><sec id="s3_3"><title>3.3. Registration</title><p>In this section, the registration process of involved parties in the system is discussed. All registrations are carried out by the HMS via a secure channel (see <xref ref-type="fig" rid="fig2">Figure 2</xref>).</p><sec id="s3_3_1"><title>3.3.1. Physician Registration</title><p>To register, D<sub>l</sub> (doctor/nurse) submits her identity id<sub>DL</sub> (e.g. an email address or social security number) to HMS. HMS first validates the submitted identity and if validation is successful it then computes the public key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x42.png" xlink:type="simple"/></inline-formula> and corresponding private key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x43.png" xlink:type="simple"/></inline-formula> for D<sub>l</sub>. The HMS then sends <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x43.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x44.png" xlink:type="simple"/></inline-formula> to D<sub>l</sub> via a secure channel.</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Registration process</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-7800395x45.png"/></fig></sec><sec id="s3_3_2"><title>3.3.2. Patient Registration</title><p>Let PT<sub>i</sub> be a patient seeking medical help from D<sub>l</sub>. To register, PT<sub>i</sub> submits her real-ID id<sub>PTi</sub> to HMS. HMS first validates submitted identity. If the validation is successful, HMS then chooses a family of n un-linkable pseudo-IDs for PT<sub>i</sub> given by:</p><disp-formula id="scirp.73527-formula87"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-7800395x46.png"  xlink:type="simple"/></disp-formula><p>For each pseudo-ID pid<sub>j</sub> in PID<sub>PTi</sub>, HMS computes the public key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x47.png" xlink:type="simple"/></inline-formula> and the corresponding private key<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x48.png" xlink:type="simple"/></inline-formula>, such that the families of public and private keys are:</p><disp-formula id="scirp.73527-formula88"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-7800395x49.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.73527-formula89"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/6-7800395x50.png"  xlink:type="simple"/></disp-formula><p>Once PT<sub>i</sub> completes registration procedures, the HMS issues her with a smartcard. The smartcard is personalized with parameters (i.e. PID<sub>PTi</sub>, PUB<sub>PTi</sub><sub>,</sub> PRI<sub>PTi</sub>, id<sub>DL</sub>, id<sub>EHR</sub>) which P can later use to register her gateway to the HMS. Upon arrival at home, PT<sub>i</sub> passes over the information in the smartcard to the gateway. Since some of the information is sensitive, an assumption is made that, once the gateway gets the parameters, it should erase the information from the memory of the smartcard to avoid security implications that may result in case the smartcard ends up in the hands of an adversary.</p><p>With these pseudo-IDs, PT<sub>i</sub> can constantly change her pseudo-IDs to achieve anonymity and un-traceability during communication process over the remote health monitoring system. The HMS also sends PID<sub>PTi</sub> to appropriate D<sub>l</sub> and EHR respectively.</p><p>To allow for revocation, the HMS adds an ExpiryDate into pid<sub>j</sub> for 0 ≤ j ≤ n − 1, such that each of the public keys <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x51.png" xlink:type="simple"/></inline-formula> is valid only before the specified expiry time t<sub>j</sub>. After the specified time, the corresponding private key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x52.png" xlink:type="simple"/></inline-formula> is revoked automatically. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x53.png" xlink:type="simple"/></inline-formula> be the set of life spans for each of the pid<sub>j</sub> for 0 ≤ j ≤ n − 1, such that t<sub>j</sub> = t<sub>j</sub><sub>−1</sub> + Δt, where Δt is a constant value for all pseudo-IDs, meaning that the length of the life span for each of the private keys is the same. Further, suppose that PT<sub>i</sub> can only use the pseudo-ID sd<sub>j</sub>, 0 ≤ j ≤ n ? 1 sequentially (i.e. that pid<sub>j</sub><sub>+1</sub> can only be used after pid<sub>j</sub> has expired). This allows D<sub>l</sub> to request for specific patient health data from EHR. This is possible because D<sub>l</sub> is also issued with PT<sub>i</sub>’s pseudo-IDs, hence making it easy for him/her to know which of the pseudo-IDs has expired or which one is the current pid<sub>j</sub> in the sequence of PT<sub>i</sub>’s pseudo IDs.</p><p>Note: according to [<xref ref-type="bibr" rid="scirp.73527-ref14">14</xref>] , a system is said to preserve pseudonimity if data records sent by the patient to the health monitoring server are linkable to each other but not to the patient’s real-ID. In the proposed scheme a patient’s pseudo IDs are assumed to be un-linkable. In this case an assumption is that the system uses other mechanisms for achieving pseudonimity and not a patient’s pseudo-IDs. But since there may be need to reveal a patient’s real-ID in cases of apparent abuse of conditions of service via judicial procedure, the proposed scheme assumes that only HMS (trusted authority) should know the relationship between the pseudo-IDs and the real-ID of the patient. As such the scheme can provide conditional privacy for the patient.</p></sec></sec><sec id="s3_4"><title>3.4. Health Information Transfer</title><p>Below the following are discussed: 1) patient health information transfer to EHR, 2) patient authentication, health information receiving and storing by the EHR and 3) patient health information request and recovery by the physician (see <xref ref-type="fig" rid="fig3">Figure 3</xref>).</p><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Message exchange among patient, EHR and physician</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/6-7800395x54.png"/></fig><sec id="s3_4_1"><title>3.4.1. Patient Health Information Transfer to HER</title><p>To send health information to EHR, PT<sub>i</sub> carries out the following steps:</p><p> Picks an unused valid pseudo-ID pid<sub>j</sub> and the corresponding private key d<sub>j</sub>.</p><p> Using this private key, PT<sub>i</sub> computes a session key <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x55.png" xlink:type="simple"/></inline-formula>. This key will be used to encrypt the health information and establish a secure channel with D<sub>l</sub>.</p><p> Using SK<sub>PTi−Dl</sub>, the PT<sub>i</sub> performs IBC-encryption on the health data as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x56.png" xlink:type="simple"/></inline-formula>, where M is the PHI and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x57.png" xlink:type="simple"/></inline-formula> is current timestamp. <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x58.png" xlink:type="simple"/></inline-formula>is added to counter replay attacks. PT<sub>i</sub> then computes the signature <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x59.png" xlink:type="simple"/></inline-formula>on C<sub>1</sub>.</p><p> Finally PT<sub>i</sub> sends the message <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x60.png" xlink:type="simple"/></inline-formula> to EHR.</p></sec><sec id="s3_4_2"><title>3.4.2. Patient Authentication, Health Information Receiving and Storage by HER</title><p>When EHR receives the message <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x61.png" xlink:type="simple"/></inline-formula> from PT<sub>i</sub>, it carries out the following authentication steps:</p><p> Checks if the timestamp <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x62.png" xlink:type="simple"/></inline-formula> satisfies the inequality <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x63.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x64.png" xlink:type="simple"/></inline-formula> is last time of message receipt by EHR and ΔT is fixed time interval between successive health information collections. This could help to counter replay attack attempts. If successful, it proceeds to examine piryDate included in pid<sub>j</sub> to verify the service expiration time.</p><p> Using public parameters and received values, EHR checks the validity of the signature by computing<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x65.png" xlink:type="simple"/></inline-formula>. The equation is valid because:</p><disp-formula id="scirp.73527-formula90"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x66.png"  xlink:type="simple"/></disp-formula><p>Once the above steps are satisfied, EHR accepts the message as authentic and stores the necessary message components (see <xref ref-type="table" rid="table2">Table 2</xref>). EHR can then either notify the respective D<sub>l</sub> of the received PHI or may wait for a message request from D<sub>l</sub>.</p></sec><sec id="s3_4_3"><title>3.4.3. Health Information Access by Physician</title><p>To access a patient’s health information, D<sub>l</sub> first gets herself authenticated to EHR by carrying out the following steps:</p><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Patient health information storing by EHR</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Patient ID</th><th align="center" valign="middle" >PHI</th><th align="center" valign="middle" >Physician ID</th></tr></thead><tr><td align="center" valign="middle" >pid<sub>j</sub></td><td align="center" valign="middle" >C<sub>1</sub></td><td align="center" valign="middle" >idDl</td></tr><tr><td align="center" valign="middle" >:</td><td align="center" valign="middle" >:</td><td align="center" valign="middle" >:</td></tr></tbody></table></table-wrap><p> Using HER’s public key, D<sub>l</sub> carries out IBC-encryption as, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x67.png" xlink:type="simple"/></inline-formula> and computes the signature <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x68.png" xlink:type="simple"/></inline-formula>. Since D<sub>l</sub> is aware that each of the patient’s pseudo-IDs has an expiry date and that they are used sequentially, when choosing pid<sub>j</sub>, D<sub>l</sub> chooses the one that is valid and current. Hence D<sub>l</sub> can request for specific patient health information from EHR depending on the specified pid<sub>j</sub>.</p><p> The D<sub>l</sub> then sends <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x69.png" xlink:type="simple"/></inline-formula> as request for a patient’s health information.</p><p> Once EHR receives the message <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x70.png" xlink:type="simple"/></inline-formula> from D<sub>l</sub>, it carries out the following steps to authenticate the request before responding.</p><p> Checks if the timestamp T<sub>Dl</sub> satisfies the inequality<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x71.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x72.png" xlink:type="simple"/></inline-formula> is the time of arrival of the request and ΔT is fixed tolerated transmission delay. This can also help in countering replay attacks.</p><p> Applies IBC-decryption as,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x73.png" xlink:type="simple"/></inline-formula>. Using id<sub>DL</sub> and public parameters, EHR validates the received signature by computing <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x73.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x74.png" xlink:type="simple"/></inline-formula>. Here;</p><disp-formula id="scirp.73527-formula91"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x75.png"  xlink:type="simple"/></disp-formula><p> Once the above steps are satisfied, EHR believes that the request is authentic and forwards the message <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x76.png" xlink:type="simple"/></inline-formula> to.</p><p>To recover, D<sub>l</sub> first computes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x77.png" xlink:type="simple"/></inline-formula> and uses it to perform IBC-decryption</p><p>On C<sub>1</sub> as,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x78.png" xlink:type="simple"/></inline-formula>.</p><p>Note:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x79.png" xlink:type="simple"/></inline-formula>. This is because:</p><disp-formula id="scirp.73527-formula92"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x80.png"  xlink:type="simple"/></disp-formula><p>Hence D<sub>l</sub> can now analyze M and give necessary and timely medical advice. By checking<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x81.png" xlink:type="simple"/></inline-formula>, D<sub>l</sub> is able to tell when the information was sent by the PT<sub>i</sub>. This can help her to estimate a patient’s health condition since the time the data was collected by biomedical devices. To send medical advice <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x82.png" xlink:type="simple"/></inline-formula> to the PT<sub>i</sub> in response to the received health information M, D<sub>l</sub> computes</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x83.png" xlink:type="simple"/></inline-formula>and encrypts <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x84.png" xlink:type="simple"/></inline-formula> using <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x85.png" xlink:type="simple"/></inline-formula> as,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x86.png" xlink:type="simple"/></inline-formula>. 𝐷<sub>𝑙</sub> then sends <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x87.png" xlink:type="simple"/></inline-formula> to PT<sub>i</sub>.</p><p>Upon receiving l, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x88.png" xlink:type="simple"/></inline-formula>, PT<sub>i</sub> first validate timestamp to overcome replay attacks. If validation is successful, PT<sub>i</sub> proceeds to compute verification code <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x89.png" xlink:type="simple"/></inline-formula> and checks if Veri = ? Auth. If the equation holds PT<sub>i</sub> believes that the message is from legitimate D<sub>l</sub> and that he/she has established a secure channel. This protects the patient from bogus medical advice which could be life threatening for him/her. PT<sub>i</sub> can now decrypt C<sub>3</sub> using <sub>PTi</sub><sub>−Dl</sub> as, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x88.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x89.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x90.png" xlink:type="simple"/></inline-formula>and act upon the medical advice.</p><p>The protocol above achieves explicit mutual authentication between PT<sub>i</sub> and D<sub>l</sub>. It also allows anonymous authentication for the PT<sub>i</sub>. Furthermore, PT<sub>i</sub> and D<sub>l</sub> successfully establish a shared symmetric key SK<sub>PTi</sub><sub>−Dl</sub> that is used for the subsequent communication session.</p></sec></sec></sec><sec id="s4"><title>4. Analysis</title><p>This section analyses desirable properties of the proposed scheme including security and privacy preserving properties. Note that other properties including patient revocation and replay attack have been analyzed in Section 4.</p><sec id="s4_1"><title>4.1. Batch Authentication</title><p>In the proposed scheme, the EHR verifies an appended signature to a message to ensure the authenticity of PT<sub>i</sub> and D<sub>l</sub>.</p><p>This means that for n distinct patients, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x91.png" xlink:type="simple"/></inline-formula>, the EHR receives <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x92.png" xlink:type="simple"/></inline-formula> signatures. All the signatures are valid if:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x93.png" xlink:type="simple"/></inline-formula>,</p><p>where pid<sub>i</sub> is just j<sup>th</sup> pseudo-ID for patient i. This batch verification equation holds since,</p><disp-formula id="scirp.73527-formula93"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x94.png"  xlink:type="simple"/></disp-formula><p>Note: the same batch verification method applies in situations where EHR receives <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x95.png" xlink:type="simple"/></inline-formula> signatures from n distinct physicians. In this case, all the signatures are valid if;</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x96.png" xlink:type="simple"/></inline-formula>,</p><p>where id<sub>l</sub> is the identity for physician l.</p></sec><sec id="s4_2"><title>4.2. Patient Service Subscription Validation</title><p>To check service subscription validation for PT<sub>i</sub>, the EHR checks signature <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x97.png" xlink:type="simple"/></inline-formula> appended to the message. The signature <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x98.png" xlink:type="simple"/></inline-formula> is a pseudo-ID-based signature. Without the private key<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x98.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x99.png" xlink:type="simple"/></inline-formula>, it is infeasible for third parties to forge a valid signature. This is because based on the hardness of the CDH problem in G<sub>1</sub>, it is difficult for someone to derive the private key sH<sub>1</sub>(pid<sub>j</sub>) given pid<sub>j</sub>, P and P<sub>pub</sub>. Hence the pseudo-ID-based signature is unforgeable and a patient’s service subscription validation can be achieved.</p></sec><sec id="s4_3"><title>4.3. Mutual Authentication</title><p>The patient and her physician achieves explicit mutual authentication. This is so because, when sending medical advice<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula>, the physician D<sub>l</sub> computes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula> and send it to PT<sub>i</sub> together with encrypted medical advice C<sub>3</sub> and timestamp <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x102.png" xlink:type="simple"/></inline-formula> as part of the message<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x103.png" xlink:type="simple"/></inline-formula>. The security of th depends on<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x104.png" xlink:type="simple"/></inline-formula>. Based on the BDH problem on {G<sub>1</sub>, G<sub>2</sub>, &#234;}, it is infeasible for an adversary to derive SK<sub>Dl</sub><sub>−PTi</sub> given id<sub>Dl</sub>, pid<sub>i</sub>, P and P<sub>pub</sub>. Furthermore, based on the non-interactive identity-based key agreement, only whose private key is d<sub>Dl</sub> and PT<sub>i</sub> who has the private key corresponding to H<sub>1</sub>(pid<sub>j</sub>) can share this key. Once PT<sub>i</sub> receive Auth he/she can then check whether <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x105.png" xlink:type="simple"/></inline-formula> holds. Note: Veri = Auth since<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x106.png" xlink:type="simple"/></inline-formula>. If the equation holds, then the patient can authenticate the message and trust that it is from the right source otherwise he/she rejects the message.</p></sec><sec id="s4_4"><title>4.4. Confidentiality</title><p>Confidentiality of a PHI entails ensuring that patient health information is not made available or disclosed to unauthorized parties including EHR itself. The proposed scheme achieves confidentiality against both insider and outsider adversaries. This is because the M is stored encrypted in EHR with SK<sub>PTi</sub><sub>−Dl</sub> as, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x107.png" xlink:type="simple"/></inline-formula>and based on the BDH problem on {G<sub>1</sub>, G<sub>2</sub>, &#234;}, it is impossible for anyone else except the legit D<sub>l</sub> to derive SK<sub>PTi</sub><sub>−Dl</sub>. The BDH problem on {G<sub>1</sub>, G<sub>2</sub>, &#234;} is: compute <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x108.png" xlink:type="simple"/></inline-formula> with known aP, bP, cP for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x107.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x109.png" xlink:type="simple"/></inline-formula>, where P is generator of G<sub>1</sub> and &#234; is the bilinear map. In our scheme if an adversary is to succeed in decrypting C<sub>1</sub>, he/she must compute</p><disp-formula id="scirp.73527-formula94"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x110.png"  xlink:type="simple"/></disp-formula><p>Given id<sub>Dl</sub>, pid<sub>j</sub>, P and P<sub>pub</sub>. This is the same as solving the BDH. Hence our scheme satisfies the confidentiality property of PHI.</p></sec><sec id="s4_5"><title>4.5. Patient Anonymity and Untraceability</title><p>In the proposed scheme, each PT<sub>i</sub> upon successful registration receives a family of n un-linkable pseudo-IDs given by,</p><disp-formula id="scirp.73527-formula95"><graphic  xlink:href="http://html.scirp.org/file/6-7800395x111.png"  xlink:type="simple"/></disp-formula><p>and corresponding private keys<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/6-7800395x112.png" xlink:type="simple"/></inline-formula>. Instead of using her real-ID for authentication and message transfer, the patient uses these issued pseudo-IDs. This ensures patient identity privacy protection since the pseudo-IDs reveals nothing about the patient’s real-ID to other parties. Since there is no linkage between the pseudo-IDs, our scheme can also achieve untraceability.</p></sec><sec id="s4_6"><title>4.6. Session Key Secrecy</title><p>As shown above, computing the session key SK<sub>PTi−HPl</sub> by adversary means solving the BDH problem in {G<sub>1</sub>, G<sub>2</sub>, &#234;}. But under the random oracle model, solving BDH is infeasible in {G<sub>1</sub>, G<sub>2</sub>, &#234;}. Hence the session key between <sub>i</sub> and D<sub>l</sub> is secure and incomputable by third parties.</p></sec></sec><sec id="s5"><title>5. Comparison</title><p><xref ref-type="table" rid="table3">Table 3</xref> below presents a comparison between proposed scheme against Huang et al.’s identity-based authentication and context privacy preservation scheme and Layouni et al.’s privacy-preserving telemonitoring for ehealth scheme.</p></sec><sec id="s6"><title>6. Conclusion</title><p>This paper has proposed a privacy preserving paring based authentication and key established scheme for wireless health monitoring systems. The proposed scheme is based on bilinear paring, IBC and non-interactive key agreement scheme using bilinearity. In the scheme, patients are only pseudonymously identified hence protecting the patients from negative effects of identity theft such as fraudulent insurance claims by adversaries. However, the scheme achieves conditional privacy, this is so because central authority―health monitoring server― knows the patients’ real identity hence in case of apparent abuse via judicial procedure, this real identity can be revealed. The security and privacy preservation analysis has shown that the scheme also achieves confidentiality of PHI, and session key secrecy. While the performance comparison has shown that our</p><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Performance comparison between proposed scheme against schemes in [<xref ref-type="bibr" rid="scirp.73527-ref13">13</xref>] and [<xref ref-type="bibr" rid="scirp.73527-ref15">15</xref>] </title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Schemes</th><th align="center" valign="middle" >Number of Parties</th><th align="center" valign="middle" >User Anonymity and Untraceability</th><th align="center" valign="middle" >Conditional Privacy Preservation</th><th align="center" valign="middle" >Patient Data Privacy against Insiders</th><th align="center" valign="middle" >Session Key Establishment between Patient &amp; Doctor</th><th align="center" valign="middle" >Patient Revocation</th></tr></thead><tr><td align="center" valign="middle" >Huang et al.’s [<xref ref-type="bibr" rid="scirp.73527-ref13">13</xref>]</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >No</td><td align="center" valign="middle" >No</td><td align="center" valign="middle" >No</td><td align="center" valign="middle" >No</td><td align="center" valign="middle" >No</td></tr><tr><td align="center" valign="middle" >Layouni et al.’s [<xref ref-type="bibr" rid="scirp.73527-ref15">15</xref>]</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >No</td><td align="center" valign="middle" >No</td></tr><tr><td align="center" valign="middle" >Proposed</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td><td align="center" valign="middle" >Yes</td></tr></tbody></table></table-wrap><p>scheme achieves more privacy preserving properties than Huang et al. and Layouni et al.’s schemes.</p></sec><sec id="s7"><title>Cite this paper</title><p>Mtonga, K., Yoon, E.J. and Kim, H.S. (2017) Authenticated Privacy Preserving Pairing-Based Scheme for Remote Health Monitoring Systems. Journal of Information Security, 8, 75-90. http://dx.doi.org/10.4236/jis.2017.81006</p></sec></body><back><ref-list><title>References</title><ref id="scirp.73527-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">An Aging World, 2013. http://www.census.gov/prod/2009pubs/p95-09-1.pdf</mixed-citation></ref><ref id="scirp.73527-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Borger, C., Smith, S., Truffer, C., Keehan, S., Sisko, A., Posal, J. and Clement, M.K. (2006) Health Spending Projections through 2015: Changes on the Horizon. Health Affairs Web Exclusive, 25, W61-W73.</mixed-citation></ref><ref id="scirp.73527-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Kumar, P. and Lee, H.J. (2012) Security Issues in Healthcare Applications Using Wireless Medical Sensor Networks: A Survey. Sensors, 12, 55-91.  
https://doi.org/10.3390/s120100055</mixed-citation></ref><ref id="scirp.73527-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Aging Heart and Arteries (2013) A Scientific Quest.  
http://www.nia.nih.gov/health/publication/aging-hearts-and-arteries-scientific-quest</mixed-citation></ref><ref id="scirp.73527-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Gaddam, A., Mukhopadhyay, S.C. and Gupta, G.S. (2011) Elder Care Based on Cognitive Sensor Network. IEEE Sensors Journal, 11, 574-581.  
https://doi.org/10.1109/JSEN.2010.2051425</mixed-citation></ref><ref id="scirp.73527-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Tablado, A., Illarramendi, A., Bermudez, J. and Goni, A. (2003) Intelligent Monitoring of Elderly People. In: Proceedings of the 4th Annual IEEE EMBS Special Topic Conference on Information Technology Applications in Biomedicine, 24-26 April 2003. https://doi.org/10.1109/itab.2003.1222447</mixed-citation></ref><ref id="scirp.73527-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Mtonga, K., Paul, A. and Rho, S. (2014) Time-and-Id-Based Proxy Re-Encryption Scheme. Journal of Applied Mathematics, 2014, Article ID: 329198. 
https://doi.org/10.1155/2014/329198</mixed-citation></ref><ref id="scirp.73527-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Mtonga, K., Yoon, E.J. and Kim, H. (2014) A Pairing Based Authentication and Key establishment Scheme for Remote Monitoring Systems. e-Infrastructure and eServices for Developing Countries, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 135, 79-89.  
https://doi.org/10.1007/978-3-319-08368-1_9</mixed-citation></ref><ref id="scirp.73527-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Ko, J., Lu, C., Srivaslava, M.B., Terzis, A. and Welsh, M. (2009) Wireless Sensor Networks for Healthcare. Proceedings of the IEEE, 98, 1947-1960.  
https://doi.org/10.1109/JPROC.2010.2065210</mixed-citation></ref><ref id="scirp.73527-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Varshney, U. (2003) Pervasive Healthcare. IEEE Computer, 36, 138-140.  
https://doi.org/10.1109/mc.2003.1250897</mixed-citation></ref><ref id="scirp.73527-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Ng, H.S., Sim, M.L. and Tan, C.M. (2006) Security Issues of Wireless Sensor Networks in Healthcare Applications. BT Technology Journal, 24, 138-144.  
https://doi.org/10.1007/s10550-006-0051-8</mixed-citation></ref><ref id="scirp.73527-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Huang, Q., Yang, X. and Li, S. (2011) Identity Authentication and Context Privacy Preservation in Wireless Health Monitoring System. International Journal of Computer Network and Information Security, 3, 53-60.  
https://doi.org/10.5815/ijcnis.2011.04.08</mixed-citation></ref><ref id="scirp.73527-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Gong, L., Lomas, T.M.A., Needham, R.M. and Saltzer, J.H. (1993) Protecting Poorly Chosen Secrets from Guessing Attacks. IEEE Journal on Selected Areas in Communications, 11, 648-656. https://doi.org/10.1109/49.223865</mixed-citation></ref><ref id="scirp.73527-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Layouni, M., Verslype, K. and Sandikkaya, M.T. (2009) Privacy-Preserving Telemonitoring for eHealth. Data and Applications Security. IFIP Annual Conference on Data and Applications Security and Privacy, Montreal, 12-15 July 2009, 95-110.</mixed-citation></ref><ref id="scirp.73527-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Hasque, M.M., Pathan, A.K. and Hong, C.S. (2008) Securing U-Healthcare Sensor Networks Using Public Key Based Scheme. 10th International Conference on Advanced Communication Technology, Gangwon-Do, 17-20 February 2008, 1108-1111.</mixed-citation></ref><ref id="scirp.73527-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Yang, Y., Deng, R.H. and Bao, F. (2006) Fortifying Password Authentication in Integrated Healthcare Delivery Systems. Proceedings of the ACM Symposium on Information, Computer and Communications Security, Taipei, 21-24 March 2006, 255-265.</mixed-citation></ref><ref id="scirp.73527-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Health Insurance Portability Accountability Act (HIPAA).</mixed-citation></ref><ref id="scirp.73527-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Boneh, D. and Franklin, M. (2001) Identity-Based Encryption from the Weil Pairing. Proceedings of Crypto 2001, Santa Barbara, 19-23 August 2001, 213-229.</mixed-citation></ref><ref id="scirp.73527-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Sakai, R. and Kasahara, M. (2000) Cryptosystems Based on Pairings. Proceedings of the 2000 Symposium on Cryptography and Information Security, Okinawa, January 2000.</mixed-citation></ref><ref id="scirp.73527-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Dupont, R. and Enge, A. (2006) Provably Secure Non-Interactive Key Distribution Based on Pairings. Discrete Applied Mathematics, 154, 270-276.  
https://doi.org/10.1016/j.dam.2005.03.024</mixed-citation></ref><ref id="scirp.73527-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">He, D., Chen, C., Chan, S. and Bu, J. (2002) Secure and Efficient Handover Authentication Based on Bilinear Pairing Functions. IEEE Transactions on Wireless Communications, 11, 48-53. https://doi.org/10.1109/TWC.2011.110811.111240</mixed-citation></ref><ref id="scirp.73527-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">National Research Council (NRC) for the Record (1997) Protecting Electric Health Information. National Academy Press, Washington DC.</mixed-citation></ref><ref id="scirp.73527-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Dixon, P. (2006) Medical Identity Theft: The Information Crime That Can Kill You. The World Privacy Forum.</mixed-citation></ref><ref id="scirp.73527-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Alan, W.M. (2006) Buying Prescription Drugs on the Internet: Promises and Pitfalls. Cleveland Clinic Journal of Medicine, 73, 282-288.  
https://doi.org/10.3949/ccjm.73.3.282</mixed-citation></ref><ref id="scirp.73527-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Liang, X., Chan, L., Lu, R., Lin, X. and Shen, X. (2011) PEC: A Privacypreserving Emergency Call Scheme for Mobile Healthcare Social Networks. IEEE/KICS Journal Communications and Networks, 13, 102-112.  
https://doi.org/10.1109/JCN.2011.6157409</mixed-citation></ref><ref id="scirp.73527-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Freudiger, J., Manshaei, M., Hubaux, J.P. and Parkes, D. (2009) On Noncooperative Location Privacy: A Game-Theoretic Analysis. Proceedings of the 16th ACM Conference on Computer and Communications Security, Chicago, 9-13 November 2009, 324-337.</mixed-citation></ref><ref id="scirp.73527-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Lu, R., Lin, X., Luan, H., Liang, X. and Shen, X. (2012) Pseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in Vanets. IEEE Transactions on Vehicular Technology, 61, 86-96. https://doi.org/10.1109/TVT.2011.2162864</mixed-citation></ref></ref-list></back></article>