This page has only limited features, please log in for full access.

Prof. Dr. Cheng-Chi Lee
Department of Library and Information Science, Fu Jen Catholic University, 510 Jhongjheng Road, Sinjhuang District, New Taipei City 24205, Taiwan

Basic Info

Basic Info is private.

Research Keywords & Expertise

0 Access Control
0 Authentication
0 Cryptography
0 Data Security
0 Network Security

Fingerprints

Authentication
Cryptography
Access Control
Wireless Communications
Data Security
Mobile communications and computing

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 21 August 2021 in Sustainability
Reads 0
Downloads 0

In the current medical insurance claims process, there are problems of low efficiency and complex services. When a patient applies for medical insurance claims, he/she must go to the hospital to apply for a diagnosis certificate and receipt and then send the relevant application documents to the insurance company. The patient will not receive compensation until the company completes the verification with the patient’s hospital. However, we can improve the current dilemma through blockchain technology. Blockchain technology can effectively open up the information channels of the insurance industry and medical institutions, promote industry integration, and enhance the ability of insurance companies to obtain information. In this research, we used blockchain and smart contract technology to make the following contributions to the development of Internet insurance. First, blockchain and smart contract technology can effectively solve the problem of online underwriting. Second, it is conducive to improving supervision. Third, it is conducive to solving risk control problems. Fourth, it is conducive to effective anti-money laundering. The proposed scheme fulfills the following security requirements: mutual authentication of identities, non-repudiation between each of two roles, and other major blockchain-based security requirements. In the event of a dispute, we also proposed an arbitration mechanism to divide responsibilities.

ACS Style

Chin-Ling Chen; Yong-Yuan Deng; Woei-Jiunn Tsaur; Chun-Ta Li; Cheng-Chi Lee; Chih-Ming Wu. A Traceable Online Insurance Claims System Based on Blockchain and Smart Contract Technology. Sustainability 2021, 13, 9386 .

AMA Style

Chin-Ling Chen, Yong-Yuan Deng, Woei-Jiunn Tsaur, Chun-Ta Li, Cheng-Chi Lee, Chih-Ming Wu. A Traceable Online Insurance Claims System Based on Blockchain and Smart Contract Technology. Sustainability. 2021; 13 (16):9386.

Chicago/Turabian Style

Chin-Ling Chen; Yong-Yuan Deng; Woei-Jiunn Tsaur; Chun-Ta Li; Cheng-Chi Lee; Chih-Ming Wu. 2021. "A Traceable Online Insurance Claims System Based on Blockchain and Smart Contract Technology." Sustainability 13, no. 16: 9386.

Journal article
Published: 08 July 2021 in Mathematics
Reads 0
Downloads 0

The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ have been proposed to solve these hard problems. Several implementations of these algorithms have been developed. On the other hand, the implementations of these algorithms are expected to be efficient in terms of run time and memory space. In this paper, a modular software package/library containing efficient implementations of GaussSieve, ProGaussSieve, HashSieve, and BKZ algorithms is developed. These implementations are considered efficient in terms of run time. While constructing this software library, some modifications to the algorithms are made to increase the performance. Then, the run times of these implementations are compared with the others. According to the experimental results, the proposed GaussSieve, ProGaussSieve, and HashSieve implementations are at least 70%, 75%, and 49% more efficient than previous ones, respectively.

ACS Style

Hami Satılmış; Sedat Akleylek; Cheng-Chi Lee. Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography. Mathematics 2021, 9, 1618 .

AMA Style

Hami Satılmış, Sedat Akleylek, Cheng-Chi Lee. Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography. Mathematics. 2021; 9 (14):1618.

Chicago/Turabian Style

Hami Satılmış; Sedat Akleylek; Cheng-Chi Lee. 2021. "Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography." Mathematics 9, no. 14: 1618.

Journal article
Published: 21 May 2021 in Sensors
Reads 0
Downloads 0

Node localisation plays a critical role in setting up Wireless Sensor Networks (WSNs). A sensor in WSNs senses, processes and transmits the sensed information simultaneously. Along with the sensed information, it is crucial to have the positional information associated with the information source. A promising method to localise these randomly deployed sensors is to use bio-inspired meta-heuristic algorithms. In this way, a node localisation problem is converted to an optimisation problem. Afterwards, the optimisation problem is solved for an optimal solution by minimising the errors. Various bio-inspired algorithms, including the conventional Cuckoo Search (CS) and modified CS algorithm, have already been explored. However, these algorithms demand a predetermined number of iterations to reach the optimal solution, even when not required. In this way, they unnecessarily exploit the limited resources of the sensors resulting in a slow search process. This paper proposes an Enhanced Cuckoo Search (ECS) algorithm to minimise the Average Localisation Error (ALE) and the time taken to localise an unknown node. In this algorithm, we have implemented an Early Stopping (ES) mechanism, which improves the search process significantly by exiting the search loop whenever the optimal solution is reached. Further, we have evaluated the ECS algorithm and compared it with the modified CS algorithm. While doing so, note that the proposed algorithm localised all the localisable nodes in the network with an ALE of 0.5–0.8 m. In addition, the proposed algorithm also shows an 80% decrease in the average time taken to localise all the localisable nodes. Consequently, the performance of the proposed ECS algorithm makes it desirable to implement in practical scenarios for node localisation.

ACS Style

Vaibhav Kotiyal; Abhilash Singh; Sandeep Sharma; JaiPrakash Nagar; Cheng-Chi Lee. ECS-NL: An Enhanced Cuckoo Search Algorithm for Node Localisation in Wireless Sensor Networks. Sensors 2021, 21, 3576 .

AMA Style

Vaibhav Kotiyal, Abhilash Singh, Sandeep Sharma, JaiPrakash Nagar, Cheng-Chi Lee. ECS-NL: An Enhanced Cuckoo Search Algorithm for Node Localisation in Wireless Sensor Networks. Sensors. 2021; 21 (11):3576.

Chicago/Turabian Style

Vaibhav Kotiyal; Abhilash Singh; Sandeep Sharma; JaiPrakash Nagar; Cheng-Chi Lee. 2021. "ECS-NL: An Enhanced Cuckoo Search Algorithm for Node Localisation in Wireless Sensor Networks." Sensors 21, no. 11: 3576.

Journal article
Published: 26 January 2021 in IEEE Systems Journal
Reads 0
Downloads 0

Wireless sensor networks (WSNs) are the backbones of numerous real-time monitoring systems that are applied to serve many different parts of our everyday lives including traffic management, telecare, pollution control, military application, among others. In most cases, WSN systems involve exchanges of sensitive/private data between the sensor nodes and the outside world. In order to preserve data privacy, illegal data access must be denied, and so the remote client has to be properly authorized by both the base station and the sensor node in order to ensure data access legitimacy. Many authentication procedures have been projected by researchers based on various frameworks of parameters such as (two-factor authentication (2-FA) = Smart card + Password) and (three-factor authentication (3-FA) = Biometric + Smart card + Password) in the literature. Das et al. (2015) projected a three-factor technique for resource-constrained distributed WSN to address the existing pitfalls. In this article, we present an analysis of Das et al.’s technique and point out some inconsistencies in the technique; demonstrating that the system is vulnerable against a known session-specific particular information attack, which thus prompts leakage of the client identity. We offer a robust subtree-based 3-FA procedure to fix the problem. In addition, we show the security strengths of our devised approach which have been established both informally and formally using the random oracle model and AVISPA tool.

ACS Style

Chandrashekhar Meshram; Mohammad S. Obaidat; Cheng-Chi Lee; Sarita Gajbhiye Meshram. An Efficient, Robust, and Lightweight Subtree-Based Three-Factor Authentication Procedure for Large-Scale DWSN in Random Oracle. IEEE Systems Journal 2021, PP, 1 -12.

AMA Style

Chandrashekhar Meshram, Mohammad S. Obaidat, Cheng-Chi Lee, Sarita Gajbhiye Meshram. An Efficient, Robust, and Lightweight Subtree-Based Three-Factor Authentication Procedure for Large-Scale DWSN in Random Oracle. IEEE Systems Journal. 2021; PP (99):1-12.

Chicago/Turabian Style

Chandrashekhar Meshram; Mohammad S. Obaidat; Cheng-Chi Lee; Sarita Gajbhiye Meshram. 2021. "An Efficient, Robust, and Lightweight Subtree-Based Three-Factor Authentication Procedure for Large-Scale DWSN in Random Oracle." IEEE Systems Journal PP, no. 99: 1-12.

Article
Published: 19 January 2021 in The Journal of Supercomputing
Reads 0
Downloads 0

Telecare medicine information system (TMIS) is recognized as an important tool for improving the quality and protection of healthcare services. In addition to protecting the privacy of patients, many authentication techniques are being introduced in TMIS. After investigations, it is observed that many authentication techniques have security breaches. In this article, we propose an efficient, secure and lightweight authentication scheme for TMIS using chaotic hash function to achieve user anonymity. Chaotic hash function constitutes potential security a set in modern cryptography with its random behavior. Also, we provide the security proof in the random oracle (RO) model and proof of correctness of algorithm is presented using (Burrows–Abadi–Needham) BAN logic for proposed scheme. The comprehensive formal and informal security review demonstrate that the security of our scheme is resistive against known potential attacks. Additionally, our presented authentication scheme performs significantly better as compared to other existing schemes in the literature and also it is efficient on the basis on high security and low cost for computational and communication.

ACS Style

Vishesh P. Gaikwad; Jitendra V. Tembhurne; Chandrashekhar Meshram; Cheng-Chi Lee. Provably secure lightweight client authentication scheme with anonymity for TMIS using chaotic hash function. The Journal of Supercomputing 2021, 1 -24.

AMA Style

Vishesh P. Gaikwad, Jitendra V. Tembhurne, Chandrashekhar Meshram, Cheng-Chi Lee. Provably secure lightweight client authentication scheme with anonymity for TMIS using chaotic hash function. The Journal of Supercomputing. 2021; ():1-24.

Chicago/Turabian Style

Vishesh P. Gaikwad; Jitendra V. Tembhurne; Chandrashekhar Meshram; Cheng-Chi Lee. 2021. "Provably secure lightweight client authentication scheme with anonymity for TMIS using chaotic hash function." The Journal of Supercomputing , no. : 1-24.

Journal article
Published: 17 November 2020 in IEEE Access
Reads 0
Downloads 0

Node localisation is one of the significant concerns in Wireless Sensor Networks (WSNs). It is a process in which we estimate the coordinates of the unknown nodes using sensors with known coordinates called anchor nodes. Several bio-inspired algorithms have been proposed for accurate estimation of the unknown nodes. However, use of bio-inspired algorithms is a highly time-consuming process. Hence, finding optimal network parameters for node localisation during the network set-up process with the desired accuracy in a short time is still a challenging task. In this article, we have proposed an efficient way to evaluate the optimal network parameters that result in low Average Localisation Error (ALE) using a machine learning approach based on Support Vector Regression (SVR) model. We have proposed three methods (S-SVR, Z-SVR and R-SVR) based on feature standardisation for fast and accurate prediction of ALE. We have considered the anchor ratio, transmission range, node density and iterations as features for training and prediction of ALE. These feature values are extracted from the modified Cuckoo Search (CS) simulations. In doing so, we found that all the methods perform exceptionally well with method R-SVR outperforming the other two methods with a correlation coefficient (R = 0.82) and Root Mean Square Error (RMSE = 0.147m).

ACS Style

Abhilash Singh; Vaibhav Kotiyal; Sandeep Sharma; JaiPrakash Nagar; Cheng-Chi Lee. A Machine Learning Approach to Predict the Average Localization Error With Applications to Wireless Sensor Networks. IEEE Access 2020, 8, 208253 -208263.

AMA Style

Abhilash Singh, Vaibhav Kotiyal, Sandeep Sharma, JaiPrakash Nagar, Cheng-Chi Lee. A Machine Learning Approach to Predict the Average Localization Error With Applications to Wireless Sensor Networks. IEEE Access. 2020; 8 ():208253-208263.

Chicago/Turabian Style

Abhilash Singh; Vaibhav Kotiyal; Sandeep Sharma; JaiPrakash Nagar; Cheng-Chi Lee. 2020. "A Machine Learning Approach to Predict the Average Localization Error With Applications to Wireless Sensor Networks." IEEE Access 8, no. : 208253-208263.

Journal article
Published: 22 September 2020 in IEEE Access
Reads 0
Downloads 0

In recent years, due to the rapid development of information techniques and network technologies, more and more medical documents have been replaced by electronic files for sharing and transmitting in real time. However, medical data transmitted over public communication channels may suffer from security attacks and privacy threats. Blockchain technology has been gotten many attentions in different areas due to its unique properties such as anonymity, verifiability, immutability and decentralization. In order to secure patient privacy and provide more personal healthcare services, in this paper, we propose a data aggregation scheme based on Blockchain technology for medical environments. Moreover, in order to implement remote medical monitoring, we design a group authentication mechanism for multiple authorized users (such as patient, doctors, caregivers, family and friends) to freely access patient’s personal health records. The authorized group members in a group will agree on a group session key and use it to protect patient’s sensitive information. In case of a new member joins the medical group or an old member leaves the medical group, the group session key needs to be updated at any time. Finally, the electronic medical system will become more secure, reliable and useful by our proposed scheme.

ACS Style

Chun-Ta Li; Dong-Her Shih; Chun-Cheng Wang; Chin-Ling Chen; Cheng-Chi Lee. A Blockchain Based Data Aggregation and Group Authentication Scheme for Electronic Medical System. IEEE Access 2020, 8, 173904 -173917.

AMA Style

Chun-Ta Li, Dong-Her Shih, Chun-Cheng Wang, Chin-Ling Chen, Cheng-Chi Lee. A Blockchain Based Data Aggregation and Group Authentication Scheme for Electronic Medical System. IEEE Access. 2020; 8 (99):173904-173917.

Chicago/Turabian Style

Chun-Ta Li; Dong-Her Shih; Chun-Cheng Wang; Chin-Ling Chen; Cheng-Chi Lee. 2020. "A Blockchain Based Data Aggregation and Group Authentication Scheme for Electronic Medical System." IEEE Access 8, no. 99: 173904-173917.

Research article
Published: 30 April 2020 in PLOS ONE
Reads 0
Downloads 0

In the Internet of Things (IoT), numerous devices can interact with each other over the Internet. A wide range of IoT applications have already been deployed, such as transportation systems, healthcare systems, smart buildings, smart factories, and smart cities. Wireless sensor networks (WSNs) play crucial roles in these IoT applications. Researchers have published effective (but not entirely secure) approaches for merging WSNs into IoT environments. In IoT environments, the security effectiveness of remote user authentication is crucial for information transmission. Computational efficiency and energy consumption are crucial because the energy available to any WSN is limited. This paper proposes a notably efficient and secure authentication scheme based on temporal credential and dynamic ID for WSNs in IoT environments. The Burrows–Abadi–Needham (BAN) logic method was used to validate our scheme. Cryptanalysis revealed that our scheme can overcome the security weaknesses of previously published schemes. The security functionalities and performance efficiency of our scheme are compared with those of previous related schemes. The result demonstrates that our scheme’s security functionalities are quantitatively and qualitatively superior to those of comparable schemes. Our scheme can improve the effectiveness of authentication in IoT environments. Notably, our scheme has superior performance efficiency, low computational cost, frugal energy consumption, and low communication cost.

ACS Style

Chi-Tung Chen; Cheng-Chi Lee; Iuon-Chang Lin. Efficient and secure three-party mutual authentication key agreement protocol for WSNs in IoT environments. PLOS ONE 2020, 15, e0232277 .

AMA Style

Chi-Tung Chen, Cheng-Chi Lee, Iuon-Chang Lin. Efficient and secure three-party mutual authentication key agreement protocol for WSNs in IoT environments. PLOS ONE. 2020; 15 (4):e0232277.

Chicago/Turabian Style

Chi-Tung Chen; Cheng-Chi Lee; Iuon-Chang Lin. 2020. "Efficient and secure three-party mutual authentication key agreement protocol for WSNs in IoT environments." PLOS ONE 15, no. 4: e0232277.

Journal article
Published: 29 April 2020 in IEEE Access
Reads 0
Downloads 0

Wireless sensor network (WSN) is a network system that involves spatially distributed devices such as wireless sensor nodes. As the data collected by the sensor nodes and transmitted through WSNs are mostly sensitive, confidential, or personal data, secure information transmission is a critical challenge, and one of the most significant security requirements is authentication. The digital signature plays a key role in ensuring data integrity, authentication and non-repudiation. In this article, we shall present an efficient, high security level online/offline subtree-based short signature scheme (OOS-SSS) using Chebyshev chaotic maps for WSN fuzzy user data sharing over a Galois field. The proposed scheme is secure in an environment of random oracle unforgeability under chosen message attack (UF-SBSS-CMA). Notably, our new design has made multiple-time usage of offline storage possible, enabling the signer to reuse offline pre-info in polynomial time instead of having only one single attempt as in the currently available online/offline signing schemes. In addition, based on our OOS-SSS design, we can build up an aggregation scheme for wireless sensor network settings. Also, the proposed scheme can be extended with some applications attached to it to allow users to register messages and implement them on WSN. Lastly, our performance comparison reveals that the proposed scheme has the lowest computational cost among six competing schemes.

ACS Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; AkshayKumar Meshram. OOS-SSS: An Efficient Online/Offline Subtree-Based Short Signature Scheme Using Chebyshev Chaotic Maps for Wireless Sensor Network. IEEE Access 2020, 8, 80063 -80073.

AMA Style

Chandrashekhar Meshram, Cheng-Chi Lee, Sarita Gajbhiye Meshram, AkshayKumar Meshram. OOS-SSS: An Efficient Online/Offline Subtree-Based Short Signature Scheme Using Chebyshev Chaotic Maps for Wireless Sensor Network. IEEE Access. 2020; 8 (99):80063-80073.

Chicago/Turabian Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; AkshayKumar Meshram. 2020. "OOS-SSS: An Efficient Online/Offline Subtree-Based Short Signature Scheme Using Chebyshev Chaotic Maps for Wireless Sensor Network." IEEE Access 8, no. 99: 80063-80073.

Foundations
Published: 24 February 2020 in Soft Computing
Reads 0
Downloads 0

Public key cryptosystems more recently developed have to be strong against newer and more advanced forms of attacks. The security protection of a public key cryptosystem relies heavily on the design of the public key. The key authentication procedure is one of the easiest and most advantageous authentication mechanisms used over insecure networks and widely applied for the remote login with various operation systems, computer networks, wireless networks, database management systems, and many others. In a typical key authentication procedure, however, there is at least one authority involved to authenticate the keys. In this paper, we shall propose a new key authentication procedure built on the basis of the decisional composite residuosity assumption. As with ordinary certificate-based procedures, the proposed procedure involves no authorities. With the certificate of the public key of a client being a blend of his/her private key and password, the proposed procedure is exceptionally secure, and the authentication process is very simple.

ACS Style

Chandrashekhar Meshram; Mohammad S. Obaidat; Cheng-Chi Lee; Sarita Gajbhiye Meshram. An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem. Soft Computing 2020, 24, 6531 -6537.

AMA Style

Chandrashekhar Meshram, Mohammad S. Obaidat, Cheng-Chi Lee, Sarita Gajbhiye Meshram. An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem. Soft Computing. 2020; 24 (9):6531-6537.

Chicago/Turabian Style

Chandrashekhar Meshram; Mohammad S. Obaidat; Cheng-Chi Lee; Sarita Gajbhiye Meshram. 2020. "An efficient key authentication procedure for IND-CCA2 secure Paillier-based cryptosystem." Soft Computing 24, no. 9: 6531-6537.

Research article
Published: 05 February 2020 in International Journal of Communication Systems
Reads 0
Downloads 0

Cloud computing technologies have been prospering in recent years and have opened an avenue for a wide variety of forms of adaptable data sharing. Taking advantage of these state‐of‐the‐art innovations, the cloud storage data owner must, however, use a suitable identity‐based cryptographic mechanism to ensure the safety prerequisites while sharing data to large numbers of cloud data users with fuzzy identities. As a successful way to guarantee secure fuzzy sharing of cloud data, the identity‐based cryptographic technology still faces an effectiveness problem under multireceiver configurations. The chaos theory is considered a reasonable strategy for reducing computational complexity while meeting the cryptographic protocol's security needs. In an identity‐based cryptographic protocol, public keys for individual clients are distributed, allowing the clients to separately select their own network identities or names as their public keys. In fact, in a public‐key cryptographic protocol, it is for the best that the confirmation of the public key is done in a safe, private manner, because this way the load of storage on the server's side can be considerably relieved. The objective of this paper is to outline and examine a conversion process that can transfer cryptosystems using Chebyshev's chaotic maps over the Galois field to a subtree‐based protocol in the cloud computing setting for fuzzy user data sharing, as opposed to reconcocting a different structure. Furthermore, in the design of our conversion process, no adjustment of the original cryptosystem based on chaotic maps is needed.

ACS Style

Chandrashekhar Meshram; Cheng-Chi Lee; Abhay S. Ranadive; Chun-Ta Li; Sarita Gajbhiye Meshram; Jitendra V. Tembhurne. A subtree-based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing. International Journal of Communication Systems 2020, 33, e4307 .

AMA Style

Chandrashekhar Meshram, Cheng-Chi Lee, Abhay S. Ranadive, Chun-Ta Li, Sarita Gajbhiye Meshram, Jitendra V. Tembhurne. A subtree-based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing. International Journal of Communication Systems. 2020; 33 (7):e4307.

Chicago/Turabian Style

Chandrashekhar Meshram; Cheng-Chi Lee; Abhay S. Ranadive; Chun-Ta Li; Sarita Gajbhiye Meshram; Jitendra V. Tembhurne. 2020. "A subtree-based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing." International Journal of Communication Systems 33, no. 7: e4307.

Mobile and wireless health
Published: 30 January 2020 in Journal of Medical Systems
Reads 0
Downloads 0

Mobile technologies are capable of offering individual level health care services to users. Mobile Healthcare (m-Healthcare) frameworks, which feature smartphone (SP) utilizations of ubiquitous computing made possible by applying wireless Body Sensor Networks (BSNs), have been introduced recently to provide SP clients with health condition monitoring and access to medical attention when necessary. However, in a vulnerable m-Healthcare framework, clients’ personal info and sensitive data can easily be poached by intruders or any malicious party, causing serious security problems and confidentiality issues. In 2013, Lu et al. proposed a mobile-Healthcare emergency framework based on privacy-preserving opportunistic computing (SPOC), claiming that their splendid SPOC construction can opportunistically gather SP resources such as computing power and energy to handle computing-intensive Personal Health Information (PHI) with minimal privacy disclosure during an emergency. To balance between the risk of personal health information exposure and the essential PHI processing and transmission, Lu et al. presented a patient-centric privacy ingress control framework based on an attribute-based ingress control mechanism and a Privacy-Preserving Scalar Product Computation (PPSPC) technique. In spite of the ingenious design, however, Lu et al.’s framework still has some security flaws in such aspects as client anonymity and mutual authentication. In this article, we shall offer an improved version of Lu et al.’s framework with the security weaknesses mended and the computation efficiency further boosted. In addition, we shall also present an enhanced mobile-Healthcare emergency framework using Partial Discrete Logarithm (PDL) which does not only achieve flawless mutual authentication as well as client anonymity but also reduce the computation cost.

ACS Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; Rakesh Jagdish Ramteke; AkshayKumar Meshram. An Efficient Mobile-Healthcare Emergency Framework. Journal of Medical Systems 2020, 44, 58 .

AMA Style

Chandrashekhar Meshram, Cheng-Chi Lee, Sarita Gajbhiye Meshram, Rakesh Jagdish Ramteke, AkshayKumar Meshram. An Efficient Mobile-Healthcare Emergency Framework. Journal of Medical Systems. 2020; 44 (3):58.

Chicago/Turabian Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; Rakesh Jagdish Ramteke; AkshayKumar Meshram. 2020. "An Efficient Mobile-Healthcare Emergency Framework." Journal of Medical Systems 44, no. 3: 58.

Editorial
Published: 29 January 2020 in Sensors
Reads 0
Downloads 0

Wireless sensor networks (WSNs) have evolved over the last few decades due to the availability of low-cost, short-range and easy deployed sensors. WSN systems focus on sensing and transmittingthe real-time sense information of a specific monitoring environment for the back-end system to do further processing and analysis [...].

ACS Style

Cheng-Chi Lee. Security and Privacy in Wireless Sensor Networks: Advances and Challenges. Sensors 2020, 20, 744 .

AMA Style

Cheng-Chi Lee. Security and Privacy in Wireless Sensor Networks: Advances and Challenges. Sensors. 2020; 20 (3):744.

Chicago/Turabian Style

Cheng-Chi Lee. 2020. "Security and Privacy in Wireless Sensor Networks: Advances and Challenges." Sensors 20, no. 3: 744.

Journal article
Published: 01 September 2019 in Journal of Neurosurgery
Reads 0
Downloads 0

OBJECTIVECranioplasty is a relatively simple and less invasive intervention, but it is associated with a high incidence of postoperative seizures. The incidence of, and the risk factors for, such seizures and the effect of prophylactic antiepileptic drugs (AEDs) have not been well studied. The authors’ aim was to evaluate the risk factors that predispose patients to postcranioplasty seizures and to examine the role of seizure prophylaxis in cranioplasty.METHODSThe records of patients who had undergone cranioplasty at the authors’ medical center between 2009 and 2014 with at last 2 years of follow-up were retrospectively reviewed. Demographic and clinical characteristics, the occurrence of postoperative seizures, and postoperative complications were analyzed.RESULTSAmong the 583 patients eligible for inclusion in the study, 247 had preexisting seizures or used AEDs before the cranioplasty and 336 had no seizures prior to cranioplasty. Of these 336 patients, 89 (26.5%) had new-onset seizures following cranioplasty. Prophylactic AEDs were administered to 56 patients for 1 week after cranioplasty. No early seizures occurred in these patients, and this finding was statistically significant (p = 0.012). Liver cirrhosis, intraoperative blood loss, and shunt-dependent hydrocephalus were risk factors for postcranioplasty seizures in the multivariable analysis.CONCLUSIONSCranioplasty is associated with a high incidence of postoperative seizures. The prophylactic use of AEDs can reduce the occurrence of early seizures.

ACS Style

Mun-Chun Yeap; Ching-Chang Chen; Zhuo-Hao Liu; Po-Chuan Hsieh; Cheng-Chi Lee; Yu-Tse Liu; Alvin Yi-Chou Wang; Yin-Cheng Huang; Kuo-Chen Wei; Chieh-Tsai Wu; Po-Hsun Tu. Postcranioplasty seizures following decompressive craniectomy and seizure prophylaxis: a retrospective analysis at a single institution. Journal of Neurosurgery 2019, 131, 936 -940.

AMA Style

Mun-Chun Yeap, Ching-Chang Chen, Zhuo-Hao Liu, Po-Chuan Hsieh, Cheng-Chi Lee, Yu-Tse Liu, Alvin Yi-Chou Wang, Yin-Cheng Huang, Kuo-Chen Wei, Chieh-Tsai Wu, Po-Hsun Tu. Postcranioplasty seizures following decompressive craniectomy and seizure prophylaxis: a retrospective analysis at a single institution. Journal of Neurosurgery. 2019; 131 (3):936-940.

Chicago/Turabian Style

Mun-Chun Yeap; Ching-Chang Chen; Zhuo-Hao Liu; Po-Chuan Hsieh; Cheng-Chi Lee; Yu-Tse Liu; Alvin Yi-Chou Wang; Yin-Cheng Huang; Kuo-Chen Wei; Chieh-Tsai Wu; Po-Hsun Tu. 2019. "Postcranioplasty seizures following decompressive craniectomy and seizure prophylaxis: a retrospective analysis at a single institution." Journal of Neurosurgery 131, no. 3: 936-940.

Journal article
Published: 30 April 2019 in Ad Hoc Networks
Reads 0
Downloads 0

Radio Frequency Identification (RFID) is a wireless communication technology nowadays widely used in almost every aspect of our lives including healthcare, logistics & supply chain management, inventory tracking, race timing, access control, toll collection, and a lot more. In RFID systems, a tag usually stores private or sensitive information, and so it needs an access control mechanism. When a tag's owner is changed, the read permission of the tag needs to be transferred from the old owner to the new owner, and this is when ownership transfer schemes come into play. In fact, not only do RFID ownership transfer schemes do ownership transfer, but they have to make sure that the ownership transfer procedure is executed under proper security protection. Besides, in some particular environments, the ownership transfer would be far more efficiently done if the tags could be treated as a group instead of individual tags. Therefore, in this paper, we propose a novel group ownership transfer protocol that satisfies all important security requirements including mutual authentication, data and location privacy, forward/backward secrecy, ownership privacy, and group ownership integrity. In addition, due to the use of cloud computing, our new protocol provides ubiquitous authentication. Based on homomorphic encryption and quadratic residues, our novel RFID group ownership transfer protocol can have encrypted data efficiently processed, and the communication cost is very low. The results of our BAN logic correctness check, security analysis, and performance evaluation confirm that the new protocol is logically correct and is capable of providing high level security/privacy protection on the basis of high cost-effective performance.

ACS Style

Cheng-Chi Lee; Chun-Ta Li; Chung-Lun Cheng; Yan-Ming Lai. A novel group ownership transfer protocol for RFID systems. Ad Hoc Networks 2019, 91, 101873 .

AMA Style

Cheng-Chi Lee, Chun-Ta Li, Chung-Lun Cheng, Yan-Ming Lai. A novel group ownership transfer protocol for RFID systems. Ad Hoc Networks. 2019; 91 ():101873.

Chicago/Turabian Style

Cheng-Chi Lee; Chun-Ta Li; Chung-Lun Cheng; Yan-Ming Lai. 2019. "A novel group ownership transfer protocol for RFID systems." Ad Hoc Networks 91, no. : 101873.

Methodologies and application
Published: 23 February 2019 in Soft Computing
Reads 0
Downloads 0

The advancement of the cloud storage technology opens up a wide range of possibilities for adaptable data sharing. When sharing data to an extensive number of users with fuzzy identities, the data proprietor must use an appropriate identity-based encryption technique that satisfies both efficiency and security prerequisites. Identity-based encryption is a promising possibility to ensure fuzzy user data sharing while meeting the security essentials; however, it may encounter efficiency trouble in multi-receiver settings. Recently, identity-based encryption has received much attention, and most of the research has aimed to apply the technique in real-world systems. A major concern about using identity-based encryption is the safety of the private keys, as disclosure of secret keys requires the reissuing of encryptions already doled out. The capability to minimize the risks associated with key disclosure is particularly important due to the increased use of mobile and unprotected devices. In this article, we shall propose a forward-secure identity-based encryption technique based on subtree for fuzzy user data sharing under cloud computing environment, and we shall demonstrate that the technique is semantically secure against a chosen subtree and chosen ciphertext attack (IND-CST–CCA). In addition, we will show the superiority of our new technique over the currently existing methods in terms of security and the length of public key. Then, we will also discuss the potential of our new technique to be deployed in pay TV systems and grid security.

ACS Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; Muhammad Khurram Khan. An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment. Soft Computing 2019, 23, 13127 -13138.

AMA Style

Chandrashekhar Meshram, Cheng-Chi Lee, Sarita Gajbhiye Meshram, Muhammad Khurram Khan. An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment. Soft Computing. 2019; 23 (24):13127-13138.

Chicago/Turabian Style

Chandrashekhar Meshram; Cheng-Chi Lee; Sarita Gajbhiye Meshram; Muhammad Khurram Khan. 2019. "An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment." Soft Computing 23, no. 24: 13127-13138.

Journal article
Published: 01 February 2019 in International Journal of Foundations of Computer Science
Reads 0
Downloads 0

The idea of public key encryption with keyword search (PEKS), proposed by Boneh et al., enables one to send a trapdoor containing a encrypted keyword to query data without revealing the keyword. In Boneh et al.’s design, the trapdoor has to be transferred through a secure channel, which is both costly and inefficient. Baek et al. then proposed an efficient secure channel free public key encryption scheme with keyword search (SCF-PEKS). After that, vast amounts of research have focused on the protection against the off-line keyword guessing attack (OKGA) by enhancing the model. However, most of the PEKS/SCF-PEKS schemes developed so far are constructed by applying bilinear pairing and are susceptible to off-line keyword guessing attacks. In this paper, we propose a new SCF-PEKS scheme based on the ElGamal cryptosystem. The proposed scheme is not only secure against off-line keyword guessing attacks but also improves the efficiency.

ACS Style

Min-Shiang Hwang; Cheng-Chi Lee; Shih-Ting Hsu. An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme. International Journal of Foundations of Computer Science 2019, 30, 255 -273.

AMA Style

Min-Shiang Hwang, Cheng-Chi Lee, Shih-Ting Hsu. An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme. International Journal of Foundations of Computer Science. 2019; 30 (2):255-273.

Chicago/Turabian Style

Min-Shiang Hwang; Cheng-Chi Lee; Shih-Ting Hsu. 2019. "An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme." International Journal of Foundations of Computer Science 30, no. 2: 255-273.

Journal article
Published: 01 January 2019 in International Journal of Electronic Security and Digital Forensics
Reads 0
Downloads 0

As the internet makes data transmission easy and fast, digital contents of all kinds can be spread all over the world at a shocking speed. Along with such amazing swiftness and convenience, however, modern computer and communication technologies have also brought various kinds of issues associated with digital rights management. Digital rights management (DRM) systems are access control technologies used to restrict the use, modification, and distribution of proprietary hardware and copyrighted works. Now, in view of modern people's heavy dependence on their mobile devices, we consider it a good idea to design a DRM scheme on the basis of elliptic curve cryptography (ECC). In this paper, we shall review Amin et al.'s (2016) scheme and point out some security weaknesses we have found. Then, with the security flaws mended, we shall propose an improved ECC-based protocol for DRM that is especially suitable for applications on mobile devices.

ACS Style

Cheng Chi Lee; Chun Ta Li; Zhi Wei Chen; Shun Der Chen; Yan Ming Lai. A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography. International Journal of Electronic Security and Digital Forensics 2019, 11, 1 .

AMA Style

Cheng Chi Lee, Chun Ta Li, Zhi Wei Chen, Shun Der Chen, Yan Ming Lai. A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography. International Journal of Electronic Security and Digital Forensics. 2019; 11 (1):1.

Chicago/Turabian Style

Cheng Chi Lee; Chun Ta Li; Zhi Wei Chen; Shun Der Chen; Yan Ming Lai. 2019. "A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography." International Journal of Electronic Security and Digital Forensics 11, no. 1: 1.

Journal article
Published: 01 January 2019 in Journal of Advances in Computer Networks
Reads 0
Downloads 0
ACS Style

Cheng-Chi Lee. A Secure Trapdoor-Indistinguishable Public Encryption Scheme with Keyword Search for Cloud Storage Service. Journal of Advances in Computer Networks 2019, 7, 1 -6.

AMA Style

Cheng-Chi Lee. A Secure Trapdoor-Indistinguishable Public Encryption Scheme with Keyword Search for Cloud Storage Service. Journal of Advances in Computer Networks. 2019; 7 (1):1-6.

Chicago/Turabian Style

Cheng-Chi Lee. 2019. "A Secure Trapdoor-Indistinguishable Public Encryption Scheme with Keyword Search for Cloud Storage Service." Journal of Advances in Computer Networks 7, no. 1: 1-6.

Journal article
Published: 01 January 2019 in International Journal of Electronic Security and Digital Forensics
Reads 0
Downloads 0
ACS Style

Cheng Chi Lee; Shun Der Chen; Chun Ta Li; Yan Ming Lai; Zhi Wei Chen. A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography. International Journal of Electronic Security and Digital Forensics 2019, 11, 96 .

AMA Style

Cheng Chi Lee, Shun Der Chen, Chun Ta Li, Yan Ming Lai, Zhi Wei Chen. A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography. International Journal of Electronic Security and Digital Forensics. 2019; 11 (1):96.

Chicago/Turabian Style

Cheng Chi Lee; Shun Der Chen; Chun Ta Li; Yan Ming Lai; Zhi Wei Chen. 2019. "A novel authentication scheme for anonymity and digital rights management based on elliptic curve cryptography." International Journal of Electronic Security and Digital Forensics 11, no. 1: 96.