Junyi Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Junyi Li has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
Yaping Lin
5 shared publications- Yaping Lin
Hunan University
4 shared publications - Zhimao Gong
Hunan University
3 shared publications - Guanzhong Yang
College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China
2 shared publications - Hongfang Gong
Changsha University of Science and Technology
2 shared publications - Jianhao Wei
College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan China 410082
2 shared publications
Latest Publications
- 18 August 2026
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 102
Feature perception - adaptive real-time privacy protection
- 18 August 2026
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 102
Feature perception - adaptive real-time privacy protection
- 14 November 2025
- Published by Elsevier in Neurocomputing
- Vol. 663
Adaptive contrastive graph attention network for recommendation
- 14 November 2025
- Published by Elsevier in Neurocomputing
- Vol. 663
Adaptive contrastive graph attention network for recommendation
- 9 October 2025
- Published by Elsevier in Computers & Security
- Vol. 159
TDSF: Trajectory-preserving method of dual-strategy fusion with differential privacy in LBS
- 9 October 2025
- Published by Elsevier in Computers & Security
- Vol. 159
TDSF: Trajectory-preserving method of dual-strategy fusion with differential privacy in LBS
- Open Access
- 2 September 2024
- Published by Springer Nature in EURASIP Journal on Information Security
- Vol. 2024 (1) , 1-14
Trajectory-aware privacy-preserving method with local differential privacy in crowdsourcing
- 2 September 2024
- Published by Springer Nature in EURASIP Journal on Information Security
- Vol. 2024 (1) , 1-14
Open AccessTrajectory-aware privacy-preserving method with local differential privacy in crowdsourcing
- 22 July 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 300
Simple Debiased Contrastive Learning for Sequential Recommendation
- 22 July 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 300
Simple Debiased Contrastive Learning for Sequential Recommendation
- 19 December 2023
- Published by Elsevier in Computers & Security
- Vol. 138
A novel dual cloud server privacy-preserving scheme in spatial crowdsourcing
- 19 December 2023
- Published by Elsevier in Computers & Security
- Vol. 138
A novel dual cloud server privacy-preserving scheme in spatial crowdsourcing
- Open Access
- 17 May 2023
- Published by MDPI AG in Electronics
- Vol. 12 (10) , 2271
P-Raft: An Efficient and Robust Consensus Mechanism for Consortium Blockchains
With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.
- 17 May 2023
- Published by MDPI AG in Electronics
- Vol. 12 (10) , 2271
Open AccessP-Raft: An Efficient and Robust Consensus Mechanism for Consortium Blockchains
With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.
- Open Access
CCIO: A Cross-Chain Interoperability Approach for Consortium Blockchains Based on Oracle
Cross-chain interoperability can expand the ability of data interaction and value circulation between different blockchains, especially the value interaction and information sharing between industry consortium blockchains. However, some current public blockchain cross-chain technologies or data migration schemes between consortium blockchains need help to meet the consortium blockchain requirements for efficient two-way data interaction. The critical issue to solve in cross-chain technology is improving the efficiency of cross-chain exchange while ensuring the security of data transmission outside the consortium blockchain. In this article, we design a cross-chain architecture based on blockchain oracle technology. Then, we propose a bidirectional information cross-chain interaction approach (CCIO) based on the former architecture, we novelly improve three traditional blockchain oracle patterns, and we combine a mixture of symmetric and asymmetric keys to encrypt private information to ensure cross-chain data security. The experimental results demonstrate that the proposed CCIO approach can achieve efficient and secure two-way cross-chain data interactions and better meet the application needs of large-scale consortium blockchains.
Open AccessCCIO: A Cross-Chain Interoperability Approach for Consortium Blockchains Based on Oracle
Cross-chain interoperability can expand the ability of data interaction and value circulation between different blockchains, especially the value interaction and information sharing between industry consortium blockchains. However, some current public blockchain cross-chain technologies or data migration schemes between consortium blockchains need help to meet the consortium blockchain requirements for efficient two-way data interaction. The critical issue to solve in cross-chain technology is improving the efficiency of cross-chain exchange while ensuring the security of data transmission outside the consortium blockchain. In this article, we design a cross-chain architecture based on blockchain oracle technology. Then, we propose a bidirectional information cross-chain interaction approach (CCIO) based on the former architecture, we novelly improve three traditional blockchain oracle patterns, and we combine a mixture of symmetric and asymmetric keys to encrypt private information to ensure cross-chain data security. The experimental results demonstrate that the proposed CCIO approach can achieve efficient and secure two-way cross-chain data interactions and better meet the application needs of large-scale consortium blockchains.
- 29 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 455-466
Efficient Privacy-Preserving Geographic Keyword Boolean Range Query Over Encrypted Spatial Data
With the widespread popularity of mobile devices and geolocation-related services, spatial keyword data has exploded in recent years. As an application, people are accustomed to using specific keywords to search for data in a given geometric range. To protect user privacy, searchable encryption technologies are used to encrypt data and user queries. Most existing works focus on either spatial attributes or keyword attributes over encrypted spatial keyword data, which cannot solve the problem of geographic keyword range queries directly. And several other works considering these two attributes have some limitations in terms of query efficiency and security assurance. In this article, we propose an efficient privacy-preserving geographic keyword Boolean range query (EPBRQ) scheme to solve existing challenges in the current work. In particular, we design a recoding algorithm to break the limits of the current work to achieve lower time complexity and employ secure Knn computation to protect user data privacy comprehensively. The security analysis shows that our solution can well protect the privacy of data and queries from cloud server threats. And numerous experiments based on real-world data also show that our scheme provides better query efficiency than existing works.
- 29 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 455-466
Efficient Privacy-Preserving Geographic Keyword Boolean Range Query Over Encrypted Spatial Data
With the widespread popularity of mobile devices and geolocation-related services, spatial keyword data has exploded in recent years. As an application, people are accustomed to using specific keywords to search for data in a given geometric range. To protect user privacy, searchable encryption technologies are used to encrypt data and user queries. Most existing works focus on either spatial attributes or keyword attributes over encrypted spatial keyword data, which cannot solve the problem of geographic keyword range queries directly. And several other works considering these two attributes have some limitations in terms of query efficiency and security assurance. In this article, we propose an efficient privacy-preserving geographic keyword Boolean range query (EPBRQ) scheme to solve existing challenges in the current work. In particular, we design a recoding algorithm to break the limits of the current work to achieve lower time complexity and employ secure Knn computation to protect user data privacy comprehensively. The security analysis shows that our solution can well protect the privacy of data and queries from cloud server threats. And numerous experiments based on real-world data also show that our scheme provides better query efficiency than existing works.