Dan Luo

Dan Luo


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
24 July 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
WCWeitong Chen
Weitong Chen
LPLu Peng
Lu Peng
DLDan Luo
Dan Luo
LJLikai Jia
Likai Jia
XLXiaomeng Liu
Xiaomeng Liu
Secure multi-party computation of Chebyshev distance represents a crucial method for confidential distance measurement, holding significant theoretical and practical implications. Especially within electronic archival management systems, secure computation of Chebyshev distance is employed for similarity measurement, classification, and clustering of sensitive archival information, thereby enhancing the security of sensitive archival queries and sharing. This paper proposes a secure protocol for computing Chebyshev distance under a semi-honest model, leveraging the additive homomorphic properties of the NTRU cryptosystem and a vector encoding method. This protocol transforms the confidential computation of Chebyshev distance into the inner product of confidential computation vectors, as demonstrated through the model paradigm validating its security under the semi-honest model. Addressing potential malicious participant scenarios, a secure protocol for computing Chebyshev distance under a malicious model is introduced, utilizing cryptographic tools such as digital commitments and mutual decryption methods. The security of this protocol under the malicious model is affirmed using the real/ideal model paradigm. Theoretical analysis and experimental simulations demonstrate the efficiency and practical applicability of the proposed schemes.

29 August 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
WCWeitong Chen
Weitong Chen
XGXinyuan Guo
Xinyuan Guo
DLDan Luo
Dan Luo
LLLanying Liang
Lanying Liang
YGYu Gu
Yu Gu
In the context of rapid advancements in big data and artificial intelligence, similarity measurement methods between samples have been widely applied in data mining, pattern recognition, medical diagnosis, financial risk control, and other fields. The Mahalanobis distance, due to its effectiveness in capturing correlations within high-dimensional data, has become a crucial tool in many practical scenarios. However, sample data often contains sensitive privacy information, making it essential to achieve secure and privacy-preserving computation of Mahalanobis distance. This paper proposes a secure Mahalanobis distance calculation scheme tailored for sample vectors that effectively resists malicious cheating behaviors. The designed multi-party computation algorithms ensure privacy protection while maintaining computational efficiency and minimizing communication overhead. The experimental results compare three algorithms in terms of execution time and communication delay across varying sample sizes and vector dimensions. The results demonstrate that our proposed scheme achieves a favorable balance between security and performance. This research provides a practical and robust solution for similarity measurement under privacy constraints and lays a theoretical and practical foundation for secure data collaboration in multi-party computing environments, offering significant application potential.

11 September 2025 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
XLXin Liu
Xin Liu
XGXinyuan Guo
Xinyuan Guo
DLDan Luo
Dan Luo
JWJi Wang
Ji Wang
SLShuo Liu
Shuo Liu
XLXiaohong Li
Xiaohong Li

6 October 2025 in Scientific Reports
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
HGHuize Gao
Huize Gao
DLDan Luo
Dan Luo
WYWei Ye
Wei Ye
LJLikai Jia
Likai Jia
YGYu Gu
Yu Gu
In the specific value computation scenario of blockchain cross-chain data exchange, participants can organize raw data in the form of data pairs, making the computed specific values become key information for cross-chain collaboration. The main challenges faced in this scenario include: the lack of appropriate privacy protection mechanisms leading to easy leakage of sensitive data; the vulnerability of unencrypted or unvalidated data to tampering or malicious attacks; a crisis of trust among users. To address the above problems, this paper introduces secure multi-party computation (MPC) into the cross-chain data exchange process to ensure the fairness of the computation process and protect data privacy. To address the problem of computing the maximum and minimum values of the sums of keyword-corresponding values in cross-chain interactions, it is transformed into the secure computation scheme of computing the maximum and minimum values of the sums of corresponding elements in the intersection of sets (MMSI). A secure computation scheme for maximum and minimum values based on the fully homomorphic NTRU (FH-NTRU) encryption algorithm is proposed. First, a secure computation protocol for MMSI without a universal set under the semi-honest model is proposed. Then, to address potential malicious behaviors in the protocol, a secure computation protocol for MMSI under the malicious model is proposed, using the cut-and-choose method. The protocol under the malicious model is analyzed for correctness and the security of the protocol is proved using the real/ideal model paradigm. Finally, the efficiency analysis and experimental simulations show that the protocol is efficient and reliable, it can resist malicious adversary attacks and ensure the correctness of the computation results while effectively improving the security during cross-chain interactions.

15 July 2025 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
HGHuize Gao
Huize Gao
DLDan Luo
Dan Luo
LLLanying Liang
Lanying Liang
LPLu Peng
Lu Peng
YGYu Gu
Yu Gu
With the advancement of blockchain technology, smart contracts are increasingly applied in finance, supply chain, healthcare, and other domains. However, the demand for multi-party data joint analysis within these contracts faces challenges of privacy leakage and malicious deception. This paper applies secure multi-party computation (MPC) to smart contracts, based on the secure computation of intersection, union, and difference of multi-party multisets (IUDMM), to protect data privacy while supporting joint analysis. Existing multiset computation protocols are primarily designed for two-party scenarios under the semi-honest model, which are unsuitable for applications involving multiple participants in smart contracts. This paper introduces a protocol for IUDMM under the semi-honest model, utilizing the multi-key NTRU encryption algorithm and a novel vector encoding method. Furthermore, to address potential malicious behaviors, an IUDMM protocol under the malicious model is designed by incorporating digital commitment method. The protocol’s correctness is analyzed, and its security is proven using the real/ideal model paradigm. Additionally, it also resists collusion attacks by any party. Finally, efficiency analysis and experimental simulations demonstrate that the proposed protocols are efficient, reliable, and fair, providing a secure and practical solution for multi-party data joint analysis and privacy protection in smart contracts.

2 January 2026
Verified
Book Chapter
Closed access
PDF file
YLYilai Lian
Yilai Lian
XLXin Liu
Xin Liu
LLLanying Liang
Lanying Liang
WYWei Ye
Wei Ye
XPXingbo Pan
Xingbo Pan
YGYu Gu
Yu Gu