Abstract

With the development of deep learning, the demand for similarity matching between texts in text classification is becoming increasingly high. How to match texts quickly under the premise of keeping private information secure has become a research hotspot. However, most existing protocols currently have full set limitations, and the applicability of these methods is limited when the data size is large and scattered. Therefore, this paper applies the secure vector calculation method for text similarity matching in the case of data without any complete set constraints, and it designs a secure computation protocol of text similarity (SCTS) based on the semi-honest model. At the same time, elliptic-curve cryptography technology is used to greatly improve the execution efficiency of the protocol. In addition, we also analyzed the possibility of the malicious behavior of participants in the semi-honest-model protocol, and further designed an SCTS protocol suitable for the malicious model using the cut-and-choose and zero-knowledge-proof methods. By proposing a security mechanism, this protocol aims to provide a reliable and secure computing solution that can effectively prevent malicious attacks and interference. Finally, through the analysis of the efficiencies of the existing protocols, the efficiencies of the protocols under the malicious model are further verified, and the practical value for text classification in deep learning is demonstrated.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call