Dan Luo

Dan Luo


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
17 November 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
XLXiaomeng Liu
Xiaomeng Liu
RZRuiling Zhang
Ruiling Zhang
DLDan Luo
Dan Luo
GXGang Xu
Gang Xu
XCXiu-Bo Chen
Xiu-Bo Chen
Manhattan distance is mainly used to calculate the total absolute wheelbase of two points in the standard coordinate system. The secure computation of Manhattan distance is a new geometric problem of secure multi-party computation. At present, the existing research secure computing protocols for Manhattan distance cannot resist the attack of malicious participants. In the real scene, the existence of malicious participants makes it necessary to study a solution that can resist malicious attacks. This paper first analyzes malicious attacks of the semi-honest model protocol of computing Manhattan distance and then designs an advanced protocol under the malicious model by using the Goldwasser–Micali encryption system and Paillier encryption algorithm, and utilizing some cryptographic tools such as the cut-choose method and zero-knowledge proof. Finally, the real/ideal model paradigm method is used to prove the security of the malicious model protocol. Compared with existing protocols, the experimental simulation shows that the proposed protocol can resist malicious participant attacks while maintaining high efficiency. It has practical value.

4 January 2023 in Electronics
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
XTXiao-Fen Tu
Xiao-Fen Tu
DLDan Luo
Dan Luo
GXGang Xu
Gang Xu
Neal XiongNeal Xiong
Neal Xiong
XCXiu-Bo Chen
Xiu-Bo Chen
In recent years, with the development of information security, secure multi-party computation has gradually become a research hotspot in the field of privacy protection. The intersection and union computation of graphs is an important branch of secure computing geometry. At present, the intersection and union of graphs are almost designed under the semi-honest model, and few solutions are proposed under the malicious model. However, the solution under the malicious model is more secure and has important theoretical and practical significance. In this paper, the possible malicious behaviors of computing the intersection and union of graphs are analyzed. Using the Lifted-ElGamal threshold cryptosystem and zero-knowledge proof method, the secure multi-party computation algorithm of graphs’ intersection and union under the malicious model is designed. The real/ideal model paradigm is used to prove the security of the algorithm, the efficiency of the algorithm is analyzed in detail, and the feasibility is verified through experiment.

1 December 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
JKJianwei Kong
Jianwei Kong
LPLu Peng
Lu Peng
DLDan Luo
Dan Luo
GXGang Xu
Gang Xu
XLXiaomeng Liu
Xiaomeng Liu
The secure computation of the graph structure is an important element in the field of secure calculation of graphs, which is important in querying data in graphs, since there are no algorithms for the graph edit distance problem that can resist attacks by malicious adversaries. In this paper, for the problem of secure computation of similarity edit distance of graphs, firstly, the encoding method applicable to the Paillier encryption algorithm is proposed, and the XOR operation scheme is proposed according to the Paillier homomorphic encryption algorithm. Then, the security algorithm under the semi-honest model is designed, which adopts the new encoding method and the XOR operation scheme. Finally, for the malicious behaviors that may be implemented by malicious participants in the semi-honest algorithm, using the hash function, a algorithm for secure computation of graph editing distance under the malicious model is designed, and the security of the algorithm is proved, and the computational complexity and the communication complexity of the algorithm are analyzed, which is more efficient compared with the existing schemes, and has practical value. The algorithm designed in this paper fills the research gap in the existing literature on the problem of graph edit distance and contributes to solving the problem.

21 March 2023 in Scientific Reports
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
YXYang Xu
Yang Xu
DLDan Luo
Dan Luo
GXGang Xu
Gang Xu
NXNeal Xiong
Neal Xiong
XCXiu-Bo Chen
Xiu-Bo Chen
With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data ‘available and invisible’. As an important branch of secure multi-party computation, the geometric problem can solve practical problems in the military, national defense, finance, life, and other fields, and has important research significance. In this paper, we study the similarity problem of geometric graphics. First, this paper proposes the adjacency matrix vector coding method of isomorphic graphics, and use the Paillier variant encryption cryptography to solve the problem of isomorphic graphics confidentiality under the semi-honest model. Using cryptography tools such as elliptic curve cryptosystem, zero-knowledge proof, and cut-choose method, this paper designs a graphic similarity security decision protocol that can resist malicious adversary attacks. The analysis shows that the protocol has high computational efficiency and has wide application value in terrain matching, mechanical parts, biomolecules, face recognition, and other fields.

10 June 2023 in Electronics
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
JKJianwei Kong
Jianwei Kong
DLDan Luo
Dan Luo
Neal XiongNeal Xiong
Neal Xiong
GXGang Xu
Gang Xu
XCXiu-Bo Chen
Xiu-Bo Chen
With natural language processing as an important research direction in deep learning, the problems of text similarity calculation, natural language inference, question and answer systems, and information retrieval can be regarded as text matching applications for different data and scenarios. Secure matching computation of text string patterns can solve the privacy protection problem in the fields of biological sequence analysis, keyword search, and database query. In this paper, we propose an Intelligent Semi-Honest System (ISHS) for secret matching against malicious adversaries. Firstly, a secure computation protocol based on the semi-honest model is designed for the secret matching of text strings, which adopts a new digital encoding method and an ECC encryption algorithm and can provide a solution for honest participants. The text string matching protocol under the malicious model which uses the cut-and-choose method and zero-knowledge proof is designed for resisting malicious behaviors that may be committed by malicious participants in the semi-honest protocol. The correctness and security of the protocol are analyzed, which is more efficient and has practical value compared with the existing algorithms. The secure text matching has important engineering applications.

24 April 2023 in Electronics
Verified
Journal Article
Open access
PDF file
XLXin Liu
Xin Liu
XLXiaomeng Liu
Xiaomeng Liu
Neal XiongNeal Xiong
Neal Xiong
DLDan Luo
Dan Luo
GXGang Xu
Gang Xu
XCXiu-Bo Chen
Xiu-Bo Chen
With the rapid development of cloud computing and other modern technologies, collaborative computing between data is increasing, and privacy protection and secure multi-party computation are also attracting more attention. The emergence of cloud computing provides new options for data holders to perform complex computing problems and to store images; however, data privacy issues cannot be ignored. If a graphic is encrypted and stored in the cloud, the cloud server will perform confidential similar matching when the user searches. At present, most research on searchable encryption is focused on text search, with few schemes researched on how to finish the graphic search. To solve this problem, this paper proposes a secure search protocol based on graph shape under the semi-honest model. Using the cut-choose method and zero-knowledge proof, further designs of the anti-malicious attack graphic similarity judgment system (AAJS) based on the Paillier encryption algorithm, can achieve the secure search and matching of the graph while resisting malicious adversary attacks. The proposed protocol’s security is proved by the real/ideal model paradigm. This paper conducts performance analysis and experimental simulation on the existing scheme and the experiments demonstrate that the system achieves high execution efficiency.