M. Abe, R. Cramer, and &. S. Fehr, Non-interactive distributed-verier proofs and proving relations among commitments, Advances in Cryptology Asiacrypt, 2002.

, Lect. Notes Comput. Sci, vol.2501, p.206223, 2002.

K. R. , Abrahamson Generalized String Matching, SIAM J. Comput, vol.16, issue.6, p.10391051, 1987.

R. Canetti, Security and composition of multiparty cryptographic protocols, J. Cryptology, vol.13, issue.1, p.143202, 2000.

D. P. Chaum-&-t and . Pedersen, Wallet Databases with Observers, Advances in Cryptology Crypto'92, vol.740, p.89105, 1993.

J. H. Cheon, S. Jarecki, and &. , Seo Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity , IACR ePrint Archive, 2010.

P. Clifford-&-r and . Clifford, Simple Deterministic Wildcard Matching, Inf. Process. Lett, vol.101, issue.2, p.5354, 2007.

J. W. Cooley and J. W. , Tukey An algorithm for the machine calculation of complex fourier series, Math. Comp, vol.19, p.297301, 1965.

R. Cramer and R. , Gennaro & B. Schoenmakers A Secure and Optimally Ecient Multi-Authority Election Scheme, Advances in Cryptology Eurocrypt'97

, Lect. Notes Comput. Sci, vol.1233, p.103118, 1997.

M. Crochemore-&-w.-rytter, . Jewels, and . Stringology, World Scientic Publishing, vol.310, 2002.

T. , A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms, IEEE Trans. Inf. Theory, vol.31, p.469472, 1985.

M. Fischer and &. Paterson, String Matching and Other Products , Complexity of Computation, SIAM-AMS, vol.7, p.113125, 1974.

R. Gennaro and C. &. Hazay, Sorensen Text Search Protocols with Simulation Based Security, PKC 2010: 13th International Conference on Theory and Practice of Public Key Cryptography, vol.6056, p.332350, 2010.

J. Groth, A Veriable Secret Shue of Homomorphic Encryptions , PKC 2003: 6th International Workshop on Theory and Practice in Public Key Cryptography, vol.2567, p.145160, 2003.

J. Groth and &. Sahai, Ecient Non-interactive Proof Systems for Bilinear Groups, Advances in Cryptology Eurocrypt, vol.4965, p.415432, 2008.

C. Hazay and &. Lindell, Ecient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, J. Cryptology, vol.23, issue.3, p.422456, 2010.

, Ecient Secure Two-Party Protocols, Information Security and Cryptography, 2010.

C. Hazay, Toft Computationally Secure Pattern Matching in the Presence of Malicious Adversaries, Advances in Cryptology -Asiacrypt, 2010.

, Lect. Notes Comput. Sci, vol.6477, p.195212, 2010.

, A. Jarrous & B. Pinkas Secure Hamming Distance Based Computation and Its Applications , ACNS 09: 7th International Conference on Applied Cryptography and Network Security, vol.5536, p.107124, 2009.

D. E. Knuth, J. H. Morris, and &. V. Pratt, Fast Pattern Matching in Strings, SIAM J. Comput, vol.6, issue.2, p.323350, 1977.

M. S. Rahman and C. S. , Iliopoulos Pattern Matching Algorithms with Don't Cares , SOFSEM 2007: Theory and Practice of Computer Science, p.116126, 2007.

C. , Schnorr Ecient Signature Generation by Smart Cards, J. Cryptology, vol.4, issue.3, p.161174, 1991.

T. Y. Schoenmeyr-&-d, Zhang FFT-based algorithms for the string matching with mismatches problem, J. Algorithms, vol.57, issue.2, p.130139, 2005.

J. R. Troncoso-pastoriza, S. Katzenbeisser, and &. , Celik Privacy preserving error resilient dna searching through oblivious automata, ACM CCS 07: 14th Conference on Computer and Communications Security, p.519528, 2007.

Y. Tsiounis and &. M. Yung, On the Security of ElGamal Based Encryption, PKC'98: 1st International Workshop on Theory and Practice in Public Key Cryptography, vol.1431, p.117134, 1998.

A. C. Yao, Protocols for Secure Computations , 23rd Annual Symposium on Foundations of Computer Science, pp.160-164, 1982.