Feipei Lai

A Secure Authentication Scheme for Telecare Medicine Information Systems

The telecare medicine information system enables or supports health-care delivery services. In recent years, the increased availability of lower-cost telecommunications systems and custom made physiological monitoring devices for patients have made it possible to bring the advantages of telemedicine directly into the patient’s home. These systems are moving towards an environment where automated patient medical records and electronically interconnected telecare facilities are prevalent. A secure authentication scheme will thus be needed to safeguard data integrity, confidentiality, and availability. Many schemes based on cryptography have been proposed for the goals. However, much of the schemes are vulnerable to various attacks, and are neither efficient, nor user friendly. Specially, in terms of efficiency, some schemes need the exponential computation resulting in high time cost. Therefore, we propose a novel authentication scheme that is added the pre-computing idea within the communication process to avoid the time-consuming exponential computations. Finally, it is shown to be more secure and practical for telecare medicine environments.

Secure and efficient group key management with shared key derivation

In many network applications, including distant learning, audio webcasting, video streaming, and online gaming, often a source has to send data to many receivers. IP multicasts and application-layer multicasts provide efficient and scalable one-to-many or many-to-many communications. A common secret key, the group key, shared by multiple users can be used to secure the information transmitted in the multicast communication channel. In this paper, a new group key management protocol is proposed to reduce the communication and computation overhead of group key rekeying caused by membership changes. With shared key derivation, new keys derivable by members themselves do not have to be encrypted or delivered by the server, and the performance of synchronous and asynchronous rekeying operations, including single join, single leave, and batch update, is thus improved. The proposed protocol is shown to be secure and immune to collusion attacks, and it outperforms the other comparable protocols from our analysis and simulation. The protocol is particularly efficient with binary key trees and asynchronous rekeying, and it can be tuned to meet different rekeying delay or key size requirements.

Access control in user hierarchy based on elliptic curve cryptosystem

This work proposes a novel key management method based on elliptic curve cryptosystem and one-way hash function to solve dynamic access problems in a user hierarchy. The proposed scheme attempts to derive the secret key of successors efficiently and non-redundantly. It includes functions such as insertion and removal of classes, updating of their relationships, and changing of secret keys. The method utilizes a Central Authority, which enables a user to change the secret key at will conveniently. Since the proposed method uses the elliptic curve cryptosystem which has a low computational cost and small key size, its performance in terms of both security and efficiency is quite commendable. Therefore, it can be anticipated that its use will be extended to wireless communication in the future.

A medium-field multivariate public-key encryption scheme

Electronic commerce fundamentally requires two different public-key cryptographical primitives, for key agreement and authentication. We present the new encryption scheme MFE, and provide a performance and security review. MFE belongs to the

Efficient Group Key Management Protocol with One-Way Key Derivation

\mathcal{MQ}

ID-based digital signature scheme on the elliptic curve cryptosystem

class, an alternative class of PKCs also termed Polynomial-Based, or multivariate. They depend on multivariate quadratic systems being unsolvable. The classical trapdoors central to PKC’s are modular exponentiation for RSA and discrete logarithms for ElGamal/DSA/ECC. But they are relatively slow and will be obsoleted by the arrival of QC (Quantum Computers). The argument for

Efficient migration for mobile computing in distributed networks

\mathcal{MQ}

Evaluating Self-Management Behaviors of Diabetic Patients in a Telehealthcare Program: Longitudinal Study Over 18 Months

-schemes is that they are usually faster, and there are no known QC-assisted attacks on them. There are several

A Password-Based User Authentication Scheme for the Integrated EPR Information System

\mathcal{MQ}

A secure electronic medical record sharing mechanism in the cloud computing platform

digital signature schemes being investigated today. But encryption (or key exchange schemes) are another story — in fact, only two other