Shujun Bi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Shujun Bi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ge Zhu
Heilongjiang University
1 shared publication Haodong Huang
School of Computer and Big Data, Heilongjiang University, Harbin, China
1 shared publication- Hengyang Wang
School of Computer and Big Data (School of Cyber Security), Heilongjiang University, Harbin, China
1 shared publication - Jinping Tang
School of Computer and Big Data (School of Cyber Security), Heilongjiang University, Harbin, China
1 shared publication Juyan Li
School of Computer and Big Data, Heilongjiang University, Harbin, China
1 shared publicationQi Yuan
College of Telecommunication and Electronic Engineering, Qiqihar University, Qiqihar, China
1 shared publication
Latest Publications
- 15 December 2025
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (1) , 46
Structured collaboration of local and global features for image super-resolution
- 15 December 2025
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (1) , 46
Structured collaboration of local and global features for image super-resolution
- Open Access
- 14 May 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-12
An efficient lattice-based integrated revocable identity-based encryption
Revocable identity-based encryption (RIBE) enables data encryption without certificates and allows for the revocation of users, thereby offering a more streamlined and secure approach to dynamic member management. However, the existing revocation models lack strong scalability, rendering the RIBE scheme unsuitable for scenarios where the key generation center (KGC) experiences high workloads and users face heavy storage burdens. Therefore, this paper introduces an integrated revocation model that maintains both the workload for the KGC and the size of the secret keys at a constant level, while also relieving the encryptor of the burden of handling revocation information. By combining online and offline encryption, we construct an OO-IRIBE-EnDKER scheme from lattices, which possesses properties such as anonymity, decryption key exposure resistance (DKER), resistance to quantum computing attacks, and selective security. Finally, the effectiveness of the OO-IRIBE-EnDKER scheme is demonstrated through experimental results.
- 14 May 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-12
Open AccessAn efficient lattice-based integrated revocable identity-based encryption
Revocable identity-based encryption (RIBE) enables data encryption without certificates and allows for the revocation of users, thereby offering a more streamlined and secure approach to dynamic member management. However, the existing revocation models lack strong scalability, rendering the RIBE scheme unsuitable for scenarios where the key generation center (KGC) experiences high workloads and users face heavy storage burdens. Therefore, this paper introduces an integrated revocation model that maintains both the workload for the KGC and the size of the secret keys at a constant level, while also relieving the encryptor of the burden of handling revocation information. By combining online and offline encryption, we construct an OO-IRIBE-EnDKER scheme from lattices, which possesses properties such as anonymity, decryption key exposure resistance (DKER), resistance to quantum computing attacks, and selective security. Finally, the effectiveness of the OO-IRIBE-EnDKER scheme is demonstrated through experimental results.