Bingbing Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bingbing Tan has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Yonghui Zhou
School of Big Data and Computer Science, Guizhou Normal University, Guiyang, China
2 shared publications Zhicheng Dong
School of Information Science and Technology Tibet University Tibet China
2 shared publications- Zhicheng Dong
Tibet University
2 shared publications - Asad Malik
School of Information Technology Monash University Malaysia Subang Jaya Malaysia
1 shared publication Bingbing Tan
Guizhou Normal University
1 shared publicationGuanglong Zhuang
Guizhou Normal University
1 shared publication
Latest Publications
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 19 (1)
Robust Text Watermarking Based on Modifying the Stroke Components of Chinese Characters
Traditional codebooks used for tracing information leakage in text documents often suffer from limitations in embedding capacity, robustness, and efficiency due to their manual generation process. This paper proposes a robust text watermarking method based on the stroke components of Chinese characters. By designing an innovative approach, Chinese character strokes are divided into several distinct components, with only specific ones being selectively modified to generate new glyphs, thus forming a unique codebook. The watermark signals are embedded by substituting the carrier glyph with the newly generated one, and the signals are extracted using a template matching method. Experimental results demonstrate that, compared to traditional manually designed codebooks, the proposed method significantly reduces human labor and computational overhead while maintaining high visual quality. Moreover, it exhibits superior robustness and adaptability across various challenging scenarios, including digital noise attacks, print‐scanning attacks, and print‐camera capture, making it a highly effective solution for protecting textual information.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 19 (1)
Open AccessRobust Text Watermarking Based on Modifying the Stroke Components of Chinese Characters
Traditional codebooks used for tracing information leakage in text documents often suffer from limitations in embedding capacity, robustness, and efficiency due to their manual generation process. This paper proposes a robust text watermarking method based on the stroke components of Chinese characters. By designing an innovative approach, Chinese character strokes are divided into several distinct components, with only specific ones being selectively modified to generate new glyphs, thus forming a unique codebook. The watermark signals are embedded by substituting the carrier glyph with the newly generated one, and the signals are extracted using a template matching method. Experimental results demonstrate that, compared to traditional manually designed codebooks, the proposed method significantly reduces human labor and computational overhead while maintaining high visual quality. Moreover, it exhibits superior robustness and adaptability across various challenging scenarios, including digital noise attacks, print‐scanning attacks, and print‐camera capture, making it a highly effective solution for protecting textual information.
- Open Access
- 24 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 189-194
A Novel Dynamic Practical Byzantine Fault Tolerance Protocol Based on Node Grouping
The Practical Byzantine Fault Tolerance protocol (PBFT) has been widely deployed in the blockchain network. However, two main issues, the communication complexity and the inability of nodes to join/exit the network without restarting the system, significantly degrade consensus efficiency. A novel dynamic practical byzantine fault tolerance protocol based on node grouping (NG-PBFT) is proposed as a solution to these problems. This protocol is realized through the grouping of nodes into consensus and observation groups. The nodes in observation group preprocess nodes’ joining/exiting requests, while the nodes in consensus group reach consensus about the preprocessed results. Furthermore, an adaptive three phases or two phases consensus mechanism that can effectively improve consensus efficiency is proposed. We provide theoretical complexity to show that our protocol reduces the communication complexity of consensus and improves consensus efficiency significantly.
- 24 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 189-194
Open AccessA Novel Dynamic Practical Byzantine Fault Tolerance Protocol Based on Node Grouping
The Practical Byzantine Fault Tolerance protocol (PBFT) has been widely deployed in the blockchain network. However, two main issues, the communication complexity and the inability of nodes to join/exit the network without restarting the system, significantly degrade consensus efficiency. A novel dynamic practical byzantine fault tolerance protocol based on node grouping (NG-PBFT) is proposed as a solution to these problems. This protocol is realized through the grouping of nodes into consensus and observation groups. The nodes in observation group preprocess nodes’ joining/exiting requests, while the nodes in consensus group reach consensus about the preprocessed results. Furthermore, an adaptive three phases or two phases consensus mechanism that can effectively improve consensus efficiency is proposed. We provide theoretical complexity to show that our protocol reduces the communication complexity of consensus and improves consensus efficiency significantly.
- Open Access
- 2 November 2023
- Published by MDPI AG in Electronics
- Vol. 12 (21) , 4512
A Cross-Institution Information-Sharing Scheme Based on a Consortium Blockchain
In today’s data-driven world, efficient and secure cross-institution information-sharing is an urgent challenge. Traditional information-sharing methods based on access controlling often suffer from issues such as privacy breaches and high communication complexity. To address this issue, this paper proposes a cross-institution information-sharing solution based on a consortium blockchain, in which it combines on-chain transaction consensus with off-chain institution storage, thereby facilitating collaboration among nodes from different institutions on the blockchain. To enhance the efficiency and security of transactions on the blockchain, we also introduce a dynamic and adaptive Practical Byzantine Fault Tolerance (DA-PBFT) consensus protocol, which permits nodes to dynamically join and exit the blockchain network, consequently improving network scalability. Through a reputation mechanism, we swiftly identify and remove faulty and malicious nodes, enhancing the trustworthiness of nodes in the information-sharing network based on consortium blockchain, thereby improving consensus efficiency. We have also employed encryption techniques to enhance the privacy and integrity of data during the process of cross-institution information sharing. A comprehensive analysis of the communication complexity in the information-sharing network confirms the effectiveness and security of our proposed solution. We offer a unique solution to improve the efficiency and security of cross-institution information-sharing while ensuring data integrity and privacy. By addressing the challenges of privacy breaches and high communication complexity in information sharing, we establish a foundation for secure cross-institution data exchange.
- 2 November 2023
- Published by MDPI AG in Electronics
- Vol. 12 (21) , 4512
Open AccessA Cross-Institution Information-Sharing Scheme Based on a Consortium Blockchain
In today’s data-driven world, efficient and secure cross-institution information-sharing is an urgent challenge. Traditional information-sharing methods based on access controlling often suffer from issues such as privacy breaches and high communication complexity. To address this issue, this paper proposes a cross-institution information-sharing solution based on a consortium blockchain, in which it combines on-chain transaction consensus with off-chain institution storage, thereby facilitating collaboration among nodes from different institutions on the blockchain. To enhance the efficiency and security of transactions on the blockchain, we also introduce a dynamic and adaptive Practical Byzantine Fault Tolerance (DA-PBFT) consensus protocol, which permits nodes to dynamically join and exit the blockchain network, consequently improving network scalability. Through a reputation mechanism, we swiftly identify and remove faulty and malicious nodes, enhancing the trustworthiness of nodes in the information-sharing network based on consortium blockchain, thereby improving consensus efficiency. We have also employed encryption techniques to enhance the privacy and integrity of data during the process of cross-institution information sharing. A comprehensive analysis of the communication complexity in the information-sharing network confirms the effectiveness and security of our proposed solution. We offer a unique solution to improve the efficiency and security of cross-institution information-sharing while ensuring data integrity and privacy. By addressing the challenges of privacy breaches and high communication complexity in information sharing, we establish a foundation for secure cross-institution data exchange.
- Open Access
- 13 July 2023
- Published by Wiley
A novel dynamic practical byzantine fault tolerance protocol based on node grouping
The Practical Byzantine Fault Tolerance protocol (PBFT) has been widely deployed in the blockchain network. However, two main issues, the communication complexity and the inability of nodes to join/exit the network without restarting the system, significantly degrade consensus efficiency. To solve these problems, we propose a novel dynamic practical byzantine fault tolerance protocol based on node grouping (NG-PBFT), which is realized by grouping nodes into consensus and observation groups. The nodes in observation group preprocess nodes’ joining/exiting requests, while the nodes in consensus group reach con sensus about the preprocessed results. Furthermore, an adaptive three phases or two phases consensus mechanism that can effectively improve consensus efficiency is proposed. We provide theoretical complexity to show that our protocol reduces the communication complexity of con sensus and improves consensus efficiency significantly.
- 13 July 2023
- Published by Wiley
Open AccessA novel dynamic practical byzantine fault tolerance protocol based on node grouping
The Practical Byzantine Fault Tolerance protocol (PBFT) has been widely deployed in the blockchain network. However, two main issues, the communication complexity and the inability of nodes to join/exit the network without restarting the system, significantly degrade consensus efficiency. To solve these problems, we propose a novel dynamic practical byzantine fault tolerance protocol based on node grouping (NG-PBFT), which is realized by grouping nodes into consensus and observation groups. The nodes in observation group preprocess nodes’ joining/exiting requests, while the nodes in consensus group reach con sensus about the preprocessed results. Furthermore, an adaptive three phases or two phases consensus mechanism that can effectively improve consensus efficiency is proposed. We provide theoretical complexity to show that our protocol reduces the communication complexity of con sensus and improves consensus efficiency significantly.