{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:28:11Z","timestamp":1758270491394,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0066"],"award-info":[{"award-number":["FA9550-13-1-0066"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10207-018-0410-8","type":"journal-article","created":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T09:41:26Z","timestamp":1527673286000},"page":"371-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Secure pattern matching based on bit parallelism"],"prefix":"10.1007","volume":"18","author":[{"given":"Mohammad Hasan","family":"Samadani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Berenjkoob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"key":"410_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: The 2003 ACM Workshop on Privacy in the Electronic Society, pp. 39\u201344. ACM (2003)","DOI":"10.1145\/1005140.1005147"},{"issue":"10","key":"410_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"key":"410_CR3","doi-asserted-by":"crossref","unstructured":"Baron, J., El Defrawy, K., Minkovich, K., Ostrovsky, R., Tressler, E.: 5PM: Secure pattern matching. Tech. rep. (2012)","DOI":"10.1007\/978-3-642-32928-9_13"},{"issue":"5","key":"410_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3233\/JCS-130481","volume":"21","author":"J Baron","year":"2013","unstructured":"Baron, J., El Defrawy, K., Minkovich, K., Ostrovsky, R., Tressler, E.: 5PM: secure pattern matching. J. Comput. Secur. 21(5), 601\u2013625 (2013)","journal-title":"J. Comput. Secur."},{"key":"410_CR5","unstructured":"Bethencourt, J.: Pallier library (2010). http:\/\/acsc.cs.utexas.edu\/libpaillier"},{"key":"410_CR6","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: Foresti, S., Jajodia, S. (eds.) Data and Applications Security and Privacy XXIV. DBSec 2010. Lecture Notes in Computer Science, vol. 6166, pp. 49\u201364. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13739-6_4"},{"key":"410_CR7","doi-asserted-by":"crossref","unstructured":"Blanton, M., Atallah, M.J., Frikken, K.B., Malluhi, Q.: Secure and efficient outsourcing of sequence comparisons. In: Computer Security\u2013ESORICS 2012, pp. 505\u2013522. Springer (2012)","DOI":"10.1007\/978-3-642-33167-1_29"},{"key":"410_CR8","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.J.: Protocols for secure remote database access with approximate matching. In: E-Commerce Security and Privacy, pp. 87\u2013111. Springer (2001)","DOI":"10.1007\/978-1-4615-1467-1_6"},{"key":"410_CR9","doi-asserted-by":"crossref","unstructured":"Faloutsos, C.: Sub-pattern matching. In: Searching Multimedia Databases by Content, pp. 77\u201381. Springer (1998)","DOI":"10.1007\/978-1-4613-1445-5_10"},{"key":"410_CR10","unstructured":"Faro, S., Lecroq, T.: Twenty years of bit-parallelism in string matching. Festschrift for Borivoj Melichar pp. 72\u2013101 (2012)"},{"key":"410_CR11","doi-asserted-by":"crossref","unstructured":"Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Data and Applications Security XXIII, pp. 81\u201394. Springer (2009)","DOI":"10.1007\/978-3-642-03007-9_6"},{"issue":"16","key":"410_CR12","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discrete Appl. Math."},{"key":"410_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Automata evaluation and text search protocols with simulation-based security. J. Cryptol. 1\u201340 (2010)","DOI":"10.1007\/978-3-642-13013-7_20"},{"key":"410_CR14","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Hazay, C., Sorensen, J.S.: Text search protocols with simulation based security. In: Public Key Cryptography\u2013PKC 2010, pp. 332\u2013350. Springer (2010)","DOI":"10.1007\/978-3-642-13013-7_20"},{"key":"410_CR15","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H.: Unstructured data bases or very efficient text searching. In: the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 117\u2013124. ACM (1983)","DOI":"10.1145\/588058.588074"},{"key":"410_CR16","doi-asserted-by":"crossref","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Advances in Cryptology-EUROCRYPT 2006, pp. 339\u2013358. Springer (2006)","DOI":"10.1007\/11761679_21"},{"issue":"3","key":"410_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00145-008-9034-x","volume":"23","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. J. Cryptol. 23(3), 422\u2013456 (2010)","journal-title":"J. Cryptol."},{"key":"410_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols: Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer, Berlin (2010)"},{"issue":"2","key":"410_CR19","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s00145-013-9147-8","volume":"27","author":"C Hazay","year":"2014","unstructured":"Hazay, C., Toft, T.: Computationally secure pattern matching in the presence of malicious adversaries. J. Cryptol. 27(2), 358\u2013395 (2014)","journal-title":"J. Cryptol."},{"key":"410_CR20","doi-asserted-by":"crossref","unstructured":"Hoffmann, H., Howard, M.D., Daily, M.J.: Fast pattern matching with time-delay neural networks. In: The 2011 International Joint Conference on Neural Networks (IJCNN), pp. 2424\u20132429. IEEE (2011)","DOI":"10.1109\/IJCNN.2011.6033533"},{"key":"410_CR21","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Secure text processing with applications to private DNA matching. In: the 17th ACM Conference on Computer and Communications Security, pp. 485\u2013492. ACM (2010)","DOI":"10.1145\/1866307.1866361"},{"key":"410_CR22","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Practical private regular expression matching. In: Security and Privacy in Dynamic Environments, pp. 461\u2013470. Springer (2006)","DOI":"10.1007\/0-387-33406-8_43"},{"key":"410_CR23","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Secure conjunctive keyword searches for unstructured text. In: 5th International Conference on Network and System Security (NSS), pp. 285\u2013289. IEEE (2011)","DOI":"10.1109\/ICNSS.2011.6060016"},{"issue":"2","key":"410_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"410_CR25","first-page":"678","volume":"2013","author":"P Laud","year":"2013","unstructured":"Laud, P., Willemson, J.: Universally composable privacy preserving finite automata execution with low online and offline complexity. IACR Cryptol. ePrint Arch. 2013, 678 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"410_CR26","unstructured":"Lindell, A.Y.: Making privacy-preserving data mining practical with smartcards. In: Black Hat Briefings (2009)"},{"key":"410_CR27","unstructured":"Melichar, B., Holub, J., Polcar, J.: Text searching algorithms. http:\/\/stringology.org\/athens (2005)"},{"key":"410_CR28","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Niksefat, S., Sadeghian, S., Sadeghiyan, B.: An efficient protocol for oblivious DFA evaluation and applications. In: Topics in Cryptology\u2013CT-RSA 2012, pp. 398\u2013415. Springer (2012)","DOI":"10.1007\/978-3-642-27954-6_25"},{"key":"410_CR29","doi-asserted-by":"crossref","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. In: Advances in Cryptology-CRYPTO92, pp. 196\u2013214. Springer (1992)","DOI":"10.1007\/3-540-48071-4_14"},{"key":"410_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. In: Advances in Cryptology-CRYPTO\u201998, pp. 267\u2013282. Springer (1998)","DOI":"10.1007\/BFb0055734"},{"key":"410_CR31","doi-asserted-by":"crossref","unstructured":"Niksefat, S., Sadeghiyan, B., Mohassel, P., Sadeghian, S.: ZIDS: A privacy-preserving intrusion detection system using secure two-party computation protocols. Comput. J. p. bxt019 (2013)","DOI":"10.1093\/comjnl\/bxt019"},{"key":"410_CR32","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology-EUROCRYPT99, pp. 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"410_CR33","first-page":"187","volume":"2005","author":"MO Rabin","year":"2005","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch. 2005, 187 (2005)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"410_CR34","doi-asserted-by":"crossref","unstructured":"Sasakawa, H., Harada, H., duVerle, D., Arimura, H., Tsuda, K., Sakuma, J.: Oblivious evaluation of non-deterministic finite automata with application to privacy-preserving virus genome detection. In: The 13th Workshop on Privacy in the Electronic Society, pp. 21\u201330. ACM (2014)","DOI":"10.1145\/2665943.2665954"},{"key":"410_CR35","unstructured":"Sipser, M.: Introduction to the Theory of Computation, vol.\u00a02. Thomson Course Technology Boston (2006)"},{"key":"410_CR36","doi-asserted-by":"crossref","unstructured":"Thomas, B.M., Ziring, N.L.: Using classified intelligence to defend unclassified networks. In: 48th Hawaii International Conference on System Sciences (HICSS), pp. 2298\u20132307. IEEE (2015)","DOI":"10.1109\/HICSS.2015.275"},{"key":"410_CR37","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: The 14th ACM Conference on Computer and Communications Security, pp. 519\u2013528. ACM (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"410_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-018-0410-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-018-0410-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-018-0410-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:44:06Z","timestamp":1751665446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-018-0410-8"}},"subtitle":["Non-interactive protocols for non-deterministic string matching automata evaluation"],"short-title":[],"issued":{"date-parts":[[2018,5,30]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["410"],"URL":"https:\/\/doi.org\/10.1007\/s10207-018-0410-8","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2018,5,30]]},"assertion":[{"value":"30 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}