Min Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Min Han has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Hongchun Lu
School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu, China
3 shared publications - Songlin He
Southwest Jiaotong University
3 shared publications - Chase Qishi Wu
New Jersey Institute of Technology
2 shared publications Hongchun Lu
2 shared publicationsSonglin He
2 shared publicationsTong Gu
2 shared publications
Latest Publications
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 326-335
OOCFSA: A Trusted Electronic Contract Signing Method Based on Adaptor Signature
With the deepening of global digital transformation, commercial interactions between enterprises are gradually migrating from traditional offline settings to open network environments. In the phase of electronic contract signing, the inherent asymmetry in signing order frequently traps enterprises in the “last-mover advantage” pitfall. Among existing solutions, relying on centralized third parties introduces single points of failure and trust bottlenecks; fully relying on blockchain-based on-chain execution schemes is prone to severe business privacy leaks and prohibitive system overheads, making it difficult to satisfy the high-frequency and confidentiality requirements of enterprise-level applications.To address these challenges, this paper proposes the On-chain and Off-chain Contract Fair Signing Agreement (OOCFSA), a trusted electronic contract signing protocol based on adaptor signatures. This method leverages the linear homomorphic properties of elliptic curve cryptography to embed fair exchange logic directly into the underlying algorithm. Consequently, it achieves strong fairness guarantees under the rational-participant model without requiring a trusted third party, relying instead on the algebraic interlocking of secret witnesses. In terms of protocol architecture, OOCFSA designs a dual-modal collaborative mechanism comprising optimistic off-chain signing and anomalous on-chain arbitration. Under optimistic conditions without default, the signing process is completed entirely off-chain in a highly efficient peer-to-peer manner, ensuring cryptographic isolation of commercial data and zero on-chain overhead. A challenge-and-response mechanism and subsequent fund confiscation are executed via smart contracts exclusively when malicious withholding or delays occur. Experimental results demonstrate that the proposed protocol effectively guarantees the trustworthiness, privacy, and security of enterprise signing interactions.
- 3 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 326-335
Open AccessOOCFSA: A Trusted Electronic Contract Signing Method Based on Adaptor Signature
With the deepening of global digital transformation, commercial interactions between enterprises are gradually migrating from traditional offline settings to open network environments. In the phase of electronic contract signing, the inherent asymmetry in signing order frequently traps enterprises in the “last-mover advantage” pitfall. Among existing solutions, relying on centralized third parties introduces single points of failure and trust bottlenecks; fully relying on blockchain-based on-chain execution schemes is prone to severe business privacy leaks and prohibitive system overheads, making it difficult to satisfy the high-frequency and confidentiality requirements of enterprise-level applications.To address these challenges, this paper proposes the On-chain and Off-chain Contract Fair Signing Agreement (OOCFSA), a trusted electronic contract signing protocol based on adaptor signatures. This method leverages the linear homomorphic properties of elliptic curve cryptography to embed fair exchange logic directly into the underlying algorithm. Consequently, it achieves strong fairness guarantees under the rational-participant model without requiring a trusted third party, relying instead on the algebraic interlocking of secret witnesses. In terms of protocol architecture, OOCFSA designs a dual-modal collaborative mechanism comprising optimistic off-chain signing and anomalous on-chain arbitration. Under optimistic conditions without default, the signing process is completed entirely off-chain in a highly efficient peer-to-peer manner, ensuring cryptographic isolation of commercial data and zero on-chain overhead. A challenge-and-response mechanism and subsequent fund confiscation are executed via smart contracts exclusively when malicious withholding or delays occur. Experimental results demonstrate that the proposed protocol effectively guarantees the trustworthiness, privacy, and security of enterprise signing interactions.
- 17 February 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 249
Improving smart contract security with transformer-based anomaly detection
- 17 February 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 249
Improving smart contract security with transformer-based anomaly detection
- Open Access
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 879-882
Research on a Supplier Quota Disparity Risk Identification Model Based on Ensemble Learning
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 879-882
Open AccessResearch on a Supplier Quota Disparity Risk Identification Model Based on Ensemble Learning
- Open Access
- 19 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 166-171
Entity Classification in Noisy Knowledge Graphs: A Graph Attention Framework with K-order Sampling and Evidential Loss Regularization
- 19 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 166-171
Open AccessEntity Classification in Noisy Knowledge Graphs: A Graph Attention Framework with K-order Sampling and Evidential Loss Regularization
- 25 September 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 185
Multi-branch and multi-loss learning for fine-grained image retrieval
- 25 September 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 185
Multi-branch and multi-loss learning for fine-grained image retrieval
- 22 September 2025
- Published by Springer Nature
- p. 134-148
Blockchain and Its Applications in the Automotive Industrial Value Chain
- 22 September 2025
- Published by Springer Nature
- p. 134-148
Blockchain and Its Applications in the Automotive Industrial Value Chain
- Open Access
- 12 February 2025
- Published by IOS Press
- p. 88-97
A Study on a Domain BERT-Based Named Entity Recognition Method for Faulty Text
Aiming at addressing the issue of highly specialized faulty text and the challenge of sparse character vectors in high-dimensional space resulting from repetitive characters and limited character types, a named entity recognition method based on Domain BERT (DBERT) is proposed. The DBERT model achieves effective dimensionality reduction and refinement of faulty text features by introducing a feature compression strategy. It also undergoes domain-specific pre-training to fully learn and adapt to the unique characteristics and specializations of faulty text. Subsequently, the DBERT model extracts context-related features of characters in the text and combines these features with specific character representations after a weighting operation. Named entity recognition is then performed using a combination of BiLSTM and CRF models. Finally, DBERT-BiLSTM-CRF is compared with LSTM-CRF and BiLSTM-CRF on an automobile maintenance domain dataset, demonstrating superior performance in terms of recall, precision, and F1 score.
- 12 February 2025
- Published by IOS Press
- p. 88-97
Open AccessA Study on a Domain BERT-Based Named Entity Recognition Method for Faulty Text
Aiming at addressing the issue of highly specialized faulty text and the challenge of sparse character vectors in high-dimensional space resulting from repetitive characters and limited character types, a named entity recognition method based on Domain BERT (DBERT) is proposed. The DBERT model achieves effective dimensionality reduction and refinement of faulty text features by introducing a feature compression strategy. It also undergoes domain-specific pre-training to fully learn and adapt to the unique characteristics and specializations of faulty text. Subsequently, the DBERT model extracts context-related features of characters in the text and combines these features with specific character representations after a weighting operation. Named entity recognition is then performed using a combination of BiLSTM and CRF models. Finally, DBERT-BiLSTM-CRF is compared with LSTM-CRF and BiLSTM-CRF on an automobile maintenance domain dataset, demonstrating superior performance in terms of recall, precision, and F1 score.
- 27 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 11 (5) , 2388-2400
SRGTNet: Subregion-Guided Transformer Hash Network for Fine-Grained Image Retrieval
Fine-grained image retrieval (FGIR) is a crucial task in computer vision, with broad applications in areas such as biodiversity monitoring, e-commerce, and medical diagnostics. However, capturing discriminative feature information to generate binary codes is difficult because of high intraclass variance and low interclass variance. To address this challenge, we (i) build a novel and highly reliable fine-grained deep hash learning framework for more accurate retrieval of fine-grained images. (ii) We propose a part significant region erasure method that forces the network to generate compact binary codes. (iii) We introduce a CNN-guided Transformer structure for use in fine-grained retrieval tasks to capture fine-grained images effectively in contextual feature relationships to mine more discriminative regional features. (iv) A multistage mixture loss is designed to optimize network training and enhance feature representation. Experiments were conducted on three publicly available fine-grained datasets. The results show that our method effectively improves the performance of fine-grained image retrieval.
- 27 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 11 (5) , 2388-2400
SRGTNet: Subregion-Guided Transformer Hash Network for Fine-Grained Image Retrieval
Fine-grained image retrieval (FGIR) is a crucial task in computer vision, with broad applications in areas such as biodiversity monitoring, e-commerce, and medical diagnostics. However, capturing discriminative feature information to generate binary codes is difficult because of high intraclass variance and low interclass variance. To address this challenge, we (i) build a novel and highly reliable fine-grained deep hash learning framework for more accurate retrieval of fine-grained images. (ii) We propose a part significant region erasure method that forces the network to generate compact binary codes. (iii) We introduce a CNN-guided Transformer structure for use in fine-grained retrieval tasks to capture fine-grained images effectively in contextual feature relationships to mine more discriminative regional features. (iv) A multistage mixture loss is designed to optimize network training and enhance feature representation. Experiments were conducted on three publicly available fine-grained datasets. The results show that our method effectively improves the performance of fine-grained image retrieval.
- Open Access
- 21 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 5035
Classification of Multi-Value Chain Business Data Resources Based on Semantic Association
Focusing on the classification of business data resources within a unified business semantic environment is an important method to simplify the data environment and a crucial approach to studying data intelligence. A multi-value chain data space is a typical business semantic heterogeneous complex data environment. This paper summarizes the characteristics of multi-value chain business data resources and proposes a study on their classification using business semantic logic. By constructing a semantic-based relational model for multi-value chain business data resources and a multi-value chain business lexicon, this paper unifies the semantics of business data resources. This creates conditions for their classification according to business logic. Based on the feature transformation of business data resources, this paper proposes a clustering algorithm for multi-value chain business data resources (Business data resource classification algorithm for multi-value chain data space, BDRCA4MVCDS) aimed at a data space, completing the classification of business data resources. Finally, comparative experiments with KMeans and KABSA demonstrate the clustering effectiveness of the proposed algorithm (BDRCA4MVCDS) as well as its good stability and adaptability.
- 21 December 2024
- Published by MDPI AG in Electronics
- Vol. 13 (24) , 5035
Open AccessClassification of Multi-Value Chain Business Data Resources Based on Semantic Association
Focusing on the classification of business data resources within a unified business semantic environment is an important method to simplify the data environment and a crucial approach to studying data intelligence. A multi-value chain data space is a typical business semantic heterogeneous complex data environment. This paper summarizes the characteristics of multi-value chain business data resources and proposes a study on their classification using business semantic logic. By constructing a semantic-based relational model for multi-value chain business data resources and a multi-value chain business lexicon, this paper unifies the semantics of business data resources. This creates conditions for their classification according to business logic. Based on the feature transformation of business data resources, this paper proposes a clustering algorithm for multi-value chain business data resources (Business data resource classification algorithm for multi-value chain data space, BDRCA4MVCDS) aimed at a data space, completing the classification of business data resources. Finally, comparative experiments with KMeans and KABSA demonstrate the clustering effectiveness of the proposed algorithm (BDRCA4MVCDS) as well as its good stability and adaptability.