Shumin Han

Dr. Shumin Han


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
14 June 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
SHShumin Han
Shumin Han
WKWang Kang
Wang Kang
DSDerong Shen
Derong Shen
CWChuang Wang
Chuang Wang
Privacy-preserving record linkage (PPRL) is the process of linking records from various data sources, ensuring that matching records for the same entity are shared among parties while not disclosing other sensitive data. However, most existing PPRL approaches currently rely on third parties for linking, posing risks of malicious tampering and privacy breaches, making it difficult to ensure the security of the linkage. Therefore, we propose a parallel multi-party PPRL method based on consortium blockchain technology which can effectively address the issue of semi-trusted third-party validation, auditing all parties involved in the PPRL process for potential malicious tampering or attacks. To improve the efficiency and security of consensus within a consortium blockchain, we propose a practical Byzantine fault tolerance consensus algorithm based on matching efficiency. Additionally, we have incorporated homomorphic encryption into Bloom filter encoding to enhance its security. To optimize computational efficiency, we have adopted the MapReduce model for parallel encryption and utilized a binary storage tree as the data structure for similarity computation. The experimental results show that our method can effectively ensure data security while also exhibiting relatively high linkage quality and scalability.

26 May 2017 in Data Science and Engineering
Verified
Journal Article
Open access
PDF file
SHShumin Han
Shumin Han
DSDerong Shen
Derong Shen
TNTiezheng Nie
Tiezheng Nie
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu
The process of matching and integrating records that relate to the same entity from one or more datasets is known as record linkage, and it has become an increasingly important subject in many application areas, including business, government and health system. The data from these areas often contain sensitive information. To prevent privacy breaches, ideally records should be linked in a private way such that no information other than the matching result is leaked in the process, and this technique is called privacy-preserving record linkage (PPRL). With the increasing data, scalability becomes the main challenge of PPRL, and many private blocking techniques have been developed for PPRL. They are aimed at reducing the number of record pairs to be compared in the matching process by removing obvious non-matching pairs without compromising privacy. However, most of them are designed for two databases and they vary widely in their ability to balance competing goals of accuracy, efficiency and security. In this paper, we propose a novel private blocking approach for PPRL based on dynamic k-anonymous blocking and Paillier cryptosystem which can be applied on two or multiple databases. In dynamic k-anonymous blocking, our approach dynamically generates blocks satisfying k-anonymity and more accurate values to represent the blocks with varying k. We also propose a novel similarity measure method which performs on the numerical attributes and combines with Paillier cryptosystem to measure the similarity of two or more blocks in security, which provides strong privacy guarantees that none information reveals even collusion. Experiments conducted on a public dataset of voter registration records validate that our approach is scalable to large databases and keeps a high quality of blocking. We compare our method with other techniques and demonstrate the increases in security and accuracy.

22 April 2022 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
SHShumin Han
Shumin Han
DSDerong Shen
Derong Shen
TNTiezheng Nie
Tiezheng Nie
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu

8 December 2022
Verified
Book Chapter
Closed access
PDF file
XHXuefei He
Xuefei He
HWHaiping Wei
Haiping Wei
SHShumin Han
Shumin Han
DSDerong Shen
Derong Shen

9 June 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
SHShumin Han
Shumin Han
YWYizi Wang
Yizi Wang
DSDerong Shen
Derong Shen
CWChuang Wang
Chuang Wang
With the advent of the big data era, data security and sharing have become the core elements of new-era data processing. Privacy-preserving record linkage (PPRL), as a method capable of accurately and securely matching and sharing the same entity across multiple data sources, is receiving increasing attention. Among the existing research methods, although PPRL methods based on Bloom Filter encoding excel in computational efficiency, they are susceptible to privacy attacks, and the security risks they face cannot be ignored. To balance the contradiction between security and computational efficiency, we propose a multi-party PPRL method based on secondary encoding. This method, based on Bloom Filter encoding, generates secondary encoding according to well-designed encoding rules and utilizes the proposed linking rules for secure matching. Owing to its excellent encoding and linking rules, this method successfully addresses the balance between security and computational efficiency. The experimental results clearly show that, in comparison to the original Bloom Filter encoding, this method has nearly equivalent computational efficiency and linkage quality. The proposed rules can effectively prevent the re-identification problem in Bloom Filter encoding (proven). Compared to existing privacy-preserving record linkage methods, this method shows higher security, making it more suitable for various practical application scenarios. The introduction of this method is of great significance for promoting the widespread application of privacy-preserving record linkage technology.

24 March 2021 in IEEE Access
Verified
Journal Article
Open access
JLJingwei Liu
Jingwei Liu
YGYi Gu
Yi Gu
SHShumin Han
Shumin Han
ZZZhibin Zhang
Zhibin Zhang
JGJiafeng Guo
Jiafeng Guo
XCXueqi Cheng
Xueqi Cheng
The deep convolutional networks have a great success in vision classification tasks. For object detection, tasks are divided into two subtasks: localization and classification. The detectors scan the whole image to generate object proposals relying on the predefined anchors or points, then classify and fine trim the proposals. The localization task plays an important role in object detection. The foreground objects and background can be easily confused under complex scenes in the existing approaches. Thus, the localization task results in a bad influence on the performance of classification problems. In order to enhance the object localization perceived, a novel method called Attentional Feature Perceive and Augmentation (Att-FPA) is constructed, which devotes setting up a feature dual perceive for localization and classification. Firstly, an attention mask branch (with an attention mask) is imported to check out if the detecting area is the background or containing one or more objects. By maintaining the feature representation of background, the attention mask is employed to strengthen the feature representation of foreground objects, which significantly enhances the localization perceived ability of objects. Moreover, Att-FPA supplies a novel way on feature re-extraction and augmentation, which further promotes the performance significantly. In the task of Ms COCO object detection, Att-FPA achieves an outstanding promotion(3.0+ mAP) than baseline (Faster-Rcnn) method. It establishes a new efficient method of feature representation, which outperforms the state-of-the-art models in object detection.