Research On Privacy-preserving Pattern Matching Protocol And Application

With the development of society and the advancement of technology,information data plays an important economic role in distributed computing and has an unshakable social status.While humans enjoy the convenience of data,it is also important to ensure the security of information data.Secure Multi-Party Computation plays a pivotal role in solving this problem,which is essentially a problem where multiple untrusted participants,each with private data,collaborate to compute a given function.Secure Two-Party Computation,with two participating entities,is a special case of Secure Multi-Party Computation,in which both participants perform a distributed computational task together while ensuring that they do not disclose private data.The Secure Pattern Matching protocol has two participating entities,the text party and the pattern party.The text party enters a long text string and the pattern party enters a short pattern string.After the protocol is executed,the pattern party learns information about the position of its pattern match in the text,and no additional information about the text and pattern is revealed except for the matching substring.This thesis designs a secure pattern matching protocol based on secure pattern matching,proves its security under the semi-honest adversary model,and designs a pattern matching system with some practicality based on the constructed secure protocol,the main research content is as follows.1.Secure Wildcard Pattern Matching is a protocol in which one of the two participants holds a wildcard pattern string t hh and the other holds a text string h,with the aim of the pattern party obtaining information about the position of its pattern matches in the text.Among them,the wildcard character * contained in the pattern t hh can match any character in the character list,and the protocol does not disclose the private input of the text and pattern parties except for the matching position information.In this thesis the Secure Multiple Types Wildcard Pattern Matching function is constructed to solve the problem of patterns containing multiple types of wildcards,where a pattern containing multiple types of wildcards(*,#)can match a specific character without revealing the private input of the text and pattern parties.The protocol can be combined with the human genetic mutation scenario.The protocol is constructed in a semi-honest adversary model,designed using Oblivious Transfer and Privacy Equality Test techniques,and proven to be secure through an Ideal/Realistic Simulation Paradigm.The security was proven by the Ideal/Realistic Simulation Paradigm.2.Aiming at the scenario of targeted mutation of nitrogen-containing bases in human genes,a privacy-preserving gene pattern matching system is designed with the help of Python language,and the requirements analysis,system architecture and specific module design are introduced in detail.The system mainly consists of a login and registration module,a gene sequence query module and a matching information return module.The corresponding algorithms for user information query and matching are designed to achieve a secure and efficient user gene sequence matching system.Finally,the system is tested for efficiency and performance testing,and by comparing it with existing work,the simulation results show that the scheme has a low computational overhead and can be safely and efficiently applied in application scenarios.