A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Text Search Protocols with Simulation Based Security
[chapter]
2010
Lecture Notes in Computer Science
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 holds a pattern and party P2 holds a text. The goal of P1 is to learn where the pattern appears in the text, without revealing it to P2 or learning anything else about P2's text. Our protocol is the first to address this problem with full security in the face of malicious adversaries. The construction is based on a novel
doi:10.1007/978-3-642-13013-7_20
fatcat:ifdo2qgyzzezbhgygf2vw3xk4q