Kuan-Ching Li

Dr. Kuan-Ching Li

Providence University
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 March 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
DHDezhi Han
Dezhi Han
NPNannan Pan
Nannan Pan
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li

27 April 2021 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
MAMamta
Mamta
BGBrij B. Gupta
Brij B. Gupta
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
VLVictor C. M. Leung
Victor C. M. Leung
KPKostas E. Psannis
Kostas E. Psannis
SYShingo Yamaguchi
Shingo Yamaguchi
The concept of sharing of personal health data over cloud storage in a healthcare-cyber physical system has become popular in recent times as it improves access quality. The privacy of health data can only be preserved by keeping it in an encrypted form, but it affects usability and flexibility in terms of effective search. Attribute-based searchable encryption (ABSE) has proven its worth by providing fine-grained searching capabilities in the shared cloud storage. However, it is not practical to apply this scheme to the devices with limited resources and storage capacity because a typical ABSE involves serious computations. In a healthcare cloud-based cyber-physical system (CCPS), the data is often collected by resource-constraint devices; therefore, here also, we cannot directly apply ABSE schemes. In the proposed work, the inherent computational cost of the ABSE scheme is managed by executing the computationally intensive tasks of a typical ABSE scheme on the blockchain network. Thus, it makes the proposed scheme suitable for online storage and retrieval of personal health data in a typical CCPS. With the assistance of blockchain technology, the proposed scheme offers two main benefits. First, it is free from a trusted authority, which makes it genuinely decentralized and free from a single point of failure. Second, it is computationally efficient because the computational load is now distributed among the consensus nodes in the blockchain network. Specifically, the task of initializing the system, which is considered the most computationally intensive, and the task of partial search token generation, which is considered as the most frequent operation, is now the responsibility of the consensus nodes. This eliminates the need of the trusted authority and reduces the burden of data users, respectively. Further, in comparison to existing decentralized fine-grained searchable encryption schemes, the proposed scheme has achieved a significant reduction in storage and computational cost for the secret key associated with users. It has been verified both theoretically and practically in the performance analysis section.

13 January 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
WLWei Liang
Wei Liang
YFYongkai Fan
Yongkai Fan
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
DZDafang Zhang
Dafang Zhang
JGJean-Luc Gaudiot
Jean-Luc Gaudiot
The massive redundant data storage and communication in network 4.0 environments have issues of low integrity, high cost, and easy tampering. To address these issues, a secure data storage and recovery scheme in the blockchain-based network is proposed by improving the decentration, tampering-proof, real-time monitoring and management of storage systems, as such design supports the dynamic storage, fast repair, and update of distributed data in the data storage system of industrial nodes. A local regenerative code technology is used to repair and store data between failed nodes while ensuring the privacy of user data. That is, as the data stored are found to be damaged, multiple local repair groups constructed by vector code can simultaneously yet efficiently repair multiple distributed data storage nodes. Based on the unique chain storage structure, such as data consensus mechanism and smart contract, the storage structure of blockchain distributed coding not only quickly repair the nearby local regenerative codes in the blockchain but also reduce the resource overhead in the data storage process of industrial nodes. Experimental results show that the proposed scheme improves the repair rate of multi-node data by 9% and data storage rate increased by 8.6%, indicating to be promising with good security and real-time performance.

25 March 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
WLWei Liang
Wei Liang
MTMingdong Tang
Mingdong Tang
JLJing Long
Jing Long
XPXin Peng
Xin Peng
JXJianlong Xu
Jianlong Xu
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
The previous blockchain data transmission techniques in industrial Internet of Things (IoT) have low security, high management cost of the trading center, and big difficulty in supervision. To address these issues, this paper proposes a secure FaBric blockchain-based data transmission technique for industrial IoT. This technique uses the blockchain-based dynamic secret sharing mechanism. A reliable trading center is realized using the power blockchain sharing model, which can also share power trading books. The power data consensus mechanism and dynamic linked storage are designed to realize the secure matching of the power data transmission. Experiments show that the optimized FaBric power data storage and transmission has high security and reliability. The proposed technique can improve the transmission rate and packet receiving rate by 12% and 13%, respectively. Moreover, the proposed technique has good superiority in sharing management and decentralization.

20 November 2021 in Soft Computing
Verified
Journal Article
Closed access
PDF file
DLDun Li
Dun Li
DHDezhi Han
Dezhi Han
TWTien Weng
Tien Weng
ZZZibin Zheng
Zibin Zheng
HLHongzhi Li
Hongzhi Li
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li

1 March 2021 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
ZXZisang Xu
Zisang Xu
WLWei Liang
Wei Liang
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
JXJianbo Xu
Jianbo Xu
HJHai Jin
Hai Jin