Qing Fan

Prof. Qing Fan

School of Control and Computer Engineering, North China Electric Power University, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 August 2021 in Journal of Systems Architecture
Verified
Journal Article
Closed access
QFQing Fan
Qing Fan
JCJianhua Chen
Jianhua Chen
LDLazarus Jegatha Deborah
Lazarus Jegatha Deborah
MLMin Luo
Min Luo

6 November 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Chuan ZhangChuan Zhang
Chuan Zhang
MZMingyang Zhao
Mingyang Zhao
Jinwen LiangJinwen Liang
Jinwen Liang
QFQing Fan
Qing Fan
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
SGSong Guo
Song Guo
Recently, increasing personal data has been stored in blockchain databases, ensuring data integrity by consensus. Although transparent and immutable blockchains are mainly adopted, the need to deploy preferences on which users can read and edit the data is growing in importance. Based on chameleon hashes, recent blockchains support editability governance but can hardly prevent data breaches because the data is readable to all participants in plaintexts. This motivates us to propose NANO, the first permissioned blockchain database that provides downward compatible readability and editability governance (i.e., users who can edit the data can also read the data). Two challenges are protecting policy privacy and efficiently revoking malicious users (e.g., users who abuse their editability privileges). The punchline is leveraging Newton's interpolation formula-based secret sharing to hide policies into polynomial parameters and govern the distribution of data decryption keys and chameleon hash trapdoors. Inspired by proxy re-encryption, NANO integrates unique user symbols into user keys, achieving linear user revocation overhead. Security analysis proves that NANO provides comprehensive privacy preservation under the chosen-ciphertext attack. Experiments on the FISCO blockchain platform demonstrate that compared with state-of-the-art related solutions, NANO achieves a 7× improvement on average regarding computational costs, gas consumption, and communication overhead.

21 December 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Chuan ZhangChuan Zhang
Chuan Zhang
MZMingyang Zhao
Mingyang Zhao
WZWeiting Zhang
Weiting Zhang
QFQing Fan
Qing Fan
Jianbing NiJianbing Ni
Jianbing Ni
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
Metaverse provides human-centric immersive communication experiences where humans can teleport across different virtual landscapes and build real-time communications via digital identities with others in the same landscape. Despite great benefits, a natural question in human-centric metaverse communications is how to secure digital content among humans. In this regard, blockchain has been widely applied due to its distinct features (e.g., decentralization, transparency, and immutability). Unfortunately, the inherent properties of the blockchain also hinder humans from further deploying preferences to flexibly govern the digital content (i.e., who can read and who can edit), limiting human-centric communication abilities. Some redactable blockchain-based solutions have been proposed, but most of them suffer from the issues of data and preference leakage. To address the issues, we propose a privacy-preserving identity-based data governance (IDRG) scheme for blockchain-empowered human-centric metaverse communications. Combining digital identities, IDRG cryptographically allows humans to govern readability and editability with the right downward compatibility (i.e., humans with editability are endowed with readability) while protecting policy privacy. Specifically, IDRG leverages the polynomial function technique to break through the bottleneck of the traditional identity-based encryption technique (i.e., a policy only contains a user) to achieve a policy for multiple users. Subsequently, the optimized policies are utilized to enrich chameleon hash-based redactable blockchains for comprehensive rights governance. Further, IDRG supports user accountability and revocation by combining the proxy re-encryption technique. Security analysis proves the security of IDRG under the chosen-ciphertext attack. Experiments on the FISCO blockchain platform demonstrate that IDRG requires approximately 0.1 s to process an encryption request, 0.01 s for a reading request, and 1 s for an editing request. Overall, IDRG achieves a 3× reduction in computational costs compared with state-of-the-art solutions.

29 July 2023 in Future Generation Computer Systems
Verified
Journal Article
Closed access
LZLiehuang Zhu
Liehuang Zhu
YXYumeng Xie
Yumeng Xie
YZYuao Zhou
Yuao Zhou
QFQing Fan
Qing Fan
Chuan ZhangChuan Zhang
Chuan Zhang
Ximeng LiuXimeng Liu
Ximeng Liu

19 July 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
YXYumeng Xie
Yumeng Xie
QFQing Fan
Qing Fan
Chuan ZhangChuan Zhang
Chuan Zhang
TWTong Wu
Tong Wu
YZYuao Zhou
Yuao Zhou
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
Threshold signatures as a method to realize multi-party cooperation and trust distribution in blockchain have been widely studied in recent years. However, among these researches, few threshold signature schemes achieve all the properties of accountability, privacy, and key protection for the EdDSA-based blockchain systems. To fill this gap, we propose an EdDSA-based accountable threshold signature protocol with privacy and proactive refresh, named TAPS-PR. Meanwhile, we define new security models and give a detailed analysis to prove protocol security. In TAPS-PR, the threshold is variable and hidden with the signing quorum from the public view. However, the signing quorum can be traced when threshold signatures related to fraudulent events are generated. We also enhance the key security of each signer by proactive refresh, which realizes updating the private key while the public key remains unchanged. Apart from that, we present ATS-PR with increased efficiency and reduced communication cost at the cost of weaker security. The theoretical analysis and experimental results indicate that our protocols perform efficiently in terms of communication and computation overhead. Furthermore, we use Tezos, a blockchain project employing EdDSA, as a case study to demonstrate the compatibility of our protocol with real-world blockchain applications.

2 August 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
QFQing Fan
Qing Fan
JCJianhua Chen
Jianhua Chen
FXFeng Xu
Feng Xu
LLLi Li
Li Li
MLMin Luo
Min Luo