{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:46:21Z","timestamp":1758271581465,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,29]],"date-time":"2017-03-29T00:00:00Z","timestamp":1490745600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572294"],"award-info":[{"award-number":["61572294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00500-017-2560-4","type":"journal-article","created":{"date-parts":[[2017,3,29]],"date-time":"2017-03-29T00:43:06Z","timestamp":1490748186000},"page":"1175-1187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient and secure outsourced approximate pattern matching protocol"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4433-1322","authenticated-orcid":false,"given":"Xiaochao","family":"Wei","sequence":"first","affiliation":[]},{"given":"Minghao","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,29]]},"reference":[{"key":"2560_CR1","doi-asserted-by":"crossref","unstructured":"Al-Khalifa S, Jagadish HV, Koudas N et\u00a0al (2002) Structural joins: a primitive for efficient XML query pattern matching. In: Proceedings of IEEE 18th international conference on data engineering, 2002, pp 141\u2013152","DOI":"10.1109\/ICDE.2002.994704"},{"key":"2560_CR2","doi-asserted-by":"crossref","unstructured":"Asharov G, Jain A, Lpez-Alt A, et\u00a0al (2012) Multiparty computation with low communication, computation and interaction via threshold FHE. In: Proceedings of the 31st annual international conference on theory and applications of cryptographic techniques (EUROCRYPT 2012). Springer, pp 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"2560_CR3","doi-asserted-by":"crossref","unstructured":"Asharov G, Lindell Y, Schneider T et\u00a0al (2013) More efficient oblivious transfer and extensions for faster secure computation. In: Proceedings of the 2013 ACM SIGSAC conference on computer and communications security. ACM, pp 535\u2013548","DOI":"10.1145\/2508859.2516738"},{"key":"2560_CR4","doi-asserted-by":"crossref","unstructured":"Baron J, El Defrawy K, Minkovich K et al (2012) 5pm: secure pattern matching. In: International conference on security and cryptography for networks. Springer, Berlin, pp 222\u2013240","DOI":"10.1007\/978-3-642-32928-9_13"},{"key":"2560_CR5","doi-asserted-by":"crossref","unstructured":"Bezawada B, Liu AX, Jayaraman B et\u00a0al (2015) Privacy preserving string matching for cloud computing. In: IEEE 35th international conference on distributed computing systems (ICDCS), 2015, pp 609\u2013618","DOI":"10.1109\/ICDCS.2015.68"},{"key":"2560_CR6","doi-asserted-by":"crossref","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS national computer conference, vol 48, pp 313\u2013317","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2560_CR7","unstructured":"Carter H, Mood B, Traynor P et\u00a0al (2013) Secure outsourced garbled circuit evaluation for mobile devices. In: Proceedings of the 22nd USENIX security symposium (USENIX security 13), 2013, pp 289\u2013304"},{"key":"2560_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1515\/popets-2015-0014","volume":"2","author":"M Chase","year":"2015","unstructured":"Chase M, Shen E (2015) Substring-searchable symmetric encryption. Proc Priv Enhanc Technol 2:263\u2013281","journal-title":"Proc Priv Enhanc Technol"},{"key":"2560_CR9","doi-asserted-by":"crossref","unstructured":"Chung KM, Kalai Y, Vadhan S (2010) Improved delegation of computation using fully homomorphic encryption. In: Advances in cryptolog, CCRYPTO, 2010, pp 483\u2013501","DOI":"10.1007\/978-3-642-14623-7_26"},{"issue":"10","key":"2560_CR10","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1109\/JSAC.2006.877131","volume":"24","author":"S Dharmapurikar","year":"2006","unstructured":"Dharmapurikar S, Lockwood JW (2006) Fast and scalable pattern matching for network intrusion detection systems. IEEE J Sel Areas Commun 24(10):1781\u20131792","journal-title":"IEEE J Sel Areas Commun"},{"issue":"6","key":"2560_CR11","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even S, Goldreich O, Lempel A (1985) A randomized protocol for signing contracts. Commun ACM 28(6):637\u2013647","journal-title":"Commun ACM"},{"key":"2560_CR12","doi-asserted-by":"crossref","unstructured":"Faber S, Jarecki S, Krawczyk H et\u00a0al (2015) Rich queries on encrypted data: beyond exact matches. In: European symposium on research in computer security. Springer, pp 123\u2013145","DOI":"10.1007\/978-3-319-24177-7_7"},{"key":"2560_CR13","doi-asserted-by":"crossref","unstructured":"Faust S, Hazay C, Venturi D (2013) Outsourced pattern matching. In: International colloquium on automata, languages, and programming. Springer, Berlin, pp 545\u2013556","DOI":"10.1007\/978-3-642-39212-2_48"},{"key":"2560_CR14","doi-asserted-by":"crossref","unstructured":"Freedman MJ, Ishai Y, Pinkas B, Reingold O (2005) Keyword search and oblivious pseudorandom functions. In: Theory of cryptography conference. Springer, Berlin, pp 303\u2013324","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"2560_CR15","doi-asserted-by":"crossref","unstructured":"Gennaro R, Hazay C, Sorensen JS (2010) Text search protocols with simulation based security. In: International workshop on public key cryptography. Springer, pp 332\u2013350","DOI":"10.1007\/978-3-642-13013-7_20"},{"key":"2560_CR16","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st annual ACM symposium on symposium on theory of computing (STOC09). ACM Press, pp 169\u2013169","DOI":"10.1145\/1536414.1536440"},{"key":"2560_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: vol 2 C basic applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) Foundations of cryptography: vol 2 C basic applications. Cambridge University Press, Cambridge"},{"key":"2560_CR18","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game\u2014a completeness theorem for protocols with honest majority. In: The 19th STOC, pp 218\u2013229"},{"key":"2560_CR19","doi-asserted-by":"crossref","unstructured":"Gennaro R, Gentry C, Parno B (2010) Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Advances in cryptology, CCRYPTO, 2010, pp 465\u2013482","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"2560_CR20","doi-asserted-by":"crossref","unstructured":"Gordon SD, Katz J, Liu FH et\u00a0al (2015) Multi-client verifiable computation with stronger security guarantees. In: Proceedings of the 12th theory of cryptography conference on theory of cryptography (TCC12). Springer, Berlin, pp 144\u2013168","DOI":"10.1007\/978-3-662-46497-7_6"},{"key":"2560_CR21","doi-asserted-by":"crossref","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 (2010) Efficient secure two-party protocols: techniques and constructions. Springer, Berlin"},{"issue":"3","key":"2560_CR22","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s00145-008-9034-x","volume":"23","author":"C Hazay","year":"2010","unstructured":"Hazay C, Lindell Y (2010) Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. J Cryptol 23(3):422\u2013456","journal-title":"J Cryptol"},{"key":"2560_CR23","doi-asserted-by":"crossref","unstructured":"Hazay C, Toft T (2010) Computationally secure pattern matching in the presence of malicious adversaries. In: International conference on the theory and application of cryptology and information security (ASIACRYPT 10). Springer, Berlin, pp 195\u2013212","DOI":"10.1007\/978-3-642-17373-8_12"},{"issue":"2","key":"2560_CR24","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/s00145-013-9147-8","volume":"27","author":"C Hazay","year":"2014","unstructured":"Hazay C, Toft T (2014) Computationally secure pattern matching in the presence of malicious adversaries. J Cryptol 27(2):358\u2013395","journal-title":"J Cryptol"},{"issue":"9","key":"2560_CR25","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1038\/ng1416","volume":"36","author":"AJ Iafrate","year":"2004","unstructured":"Iafrate AJ, Feuk L, Rivera MN et al (2004) Detection of large-scale variation in the human genome. Nat Genet 36(9):949\u2013951","journal-title":"Nat Genet"},{"key":"2560_CR26","doi-asserted-by":"crossref","unstructured":"Ishai Y, Kilian J, Nissim K et al (2003) Extending oblivious transfers efficiently. In: Annual international cryptology conference. Springer, Berlin, pp 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"2560_CR27","doi-asserted-by":"crossref","unstructured":"Jia N, Jia X, Wang D et\u00a0al (2016) Structured queries with generalized pattern matching on encrypted cloud data. In: 2016 IEEE international conference on communications (ICC). IEEE, pp 1\u20137","DOI":"10.1109\/ICC.2016.7511326"},{"issue":"2","key":"2560_CR28","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp RM, Rabin MO (1987) Efficient randomized pattern-matching algorithms. IBM J Res Dev 31(2):249\u2013260","journal-title":"IBM J Res Dev"},{"issue":"2","key":"2560_CR29","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth DE, Morris JH Jr, Pratt VR (1977) Fast pattern matching in strings. SIAM J Comput 6(2):323\u2013350","journal-title":"SIAM J Comput"},{"key":"2560_CR30","unstructured":"Kamara S, Mohassel P, Raykova M (2011) Outsourcing multi-party computation. Cryptology ePrint Archive, Report 2011\/272, 2011. http:\/\/eprint.iacr.org\/"},{"key":"2560_CR31","doi-asserted-by":"crossref","unstructured":"Kamara S, Mohassel P, Riva B (2012) Salus: a system for server-aided secure function evaluation. In: Proceedings of the 2012 ACM conference on computer and communications security. ACM, pp 797\u2013808","DOI":"10.1145\/2382196.2382280"},{"key":"2560_CR32","doi-asserted-by":"crossref","unstructured":"Katz J, Malka L (2010) Secure text processing with applications to private DNA matching. In: Proceedings of the 17th ACM conference on computer and communications security. ACM, pp 485\u2013492","DOI":"10.1145\/1866307.1866361"},{"key":"2560_CR33","unstructured":"Liu Z, Groszschaedl J, Hu Z et\u00a0al (2016a) Elliptic curve cryptography with efficiently computable endomorphisms and its hardware implementations for the internet of things. IEEE Trans Comput. http:\/\/ieeexplore.ieee.org\/abstract\/document\/7727929\/ . Accessed 12 Mar 2017"},{"key":"2560_CR34","doi-asserted-by":"crossref","unstructured":"Liu Z, Huang X, Hu Z et\u00a0al (2016b) On emerging family of elliptic curves to secure internet of things: Ecc comes of age. IEEE Trans Dependable Secur Comput. http:\/\/ieeexplore.ieee.org\/abstract\/document\/7486126\/ . Accessed 12 Mar 2017","DOI":"10.1109\/TDSC.2016.2577022"},{"key":"2560_CR35","doi-asserted-by":"crossref","unstructured":"Lpez-Alt A, Tromer E, Vaikuntanathan V (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the forty-fourth annual ACM symposium on theory of computing (STOC12). ACM, pp 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"2560_CR36","doi-asserted-by":"crossref","unstructured":"Motoyama M, McCoy D, Levchenko K et\u00a0al (2011) An analysis of underground forums. In: Proceedings of the 2011 ACM SIGCOMM conference on internet measurement conference. ACM, pp 71\u201380","DOI":"10.1145\/2068816.2068824"},{"key":"2560_CR37","doi-asserted-by":"crossref","unstructured":"Mohassel P, Niksefat S, Sadeghian S et al (2012) An efficient protocol for oblivious DFA evaluation and applications. In: Cryptographers track at the RSA conference. Springer, Berlin, pp 398\u2013415","DOI":"10.1007\/978-3-642-27954-6_25"},{"key":"2560_CR38","doi-asserted-by":"crossref","unstructured":"Naor M, Pinkas B, Sumner R (1999) Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM conference on electronic commerce. ACM, pp 129\u2013139","DOI":"10.1145\/336992.337028"},{"key":"2560_CR39","unstructured":"Rabin MO (1981) How to exchange secrets by oblivious transfer. Technical report, Harvard University"},{"issue":"5045","key":"2560_CR40","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1126\/science.1738844","volume":"255","author":"NJ Risch","year":"1992","unstructured":"Risch NJ, Devlin B (1992) On the probability of matching DNA fingerprints. Science 255(5045):717","journal-title":"Science"},{"key":"2560_CR41","doi-asserted-by":"crossref","unstructured":"Sasakawa H, Harada H, duVerle D et\u00a0al (2014) Oblivious evaluation of non-deterministic finite automata with application to privacy-preserving virus genome detection. In: Proceedings of the 13th workshop on privacy in the electronic society. ACM, pp 21\u201330","DOI":"10.1145\/2665943.2665954"},{"issue":"11","key":"2560_CR42","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"2560_CR43","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S1361-3723(10)70022-1","volume":"3","author":"A Shulman","year":"2010","unstructured":"Shulman A (2010) The underground credentials market. Comput Fraud Secur 3:5\u20138","journal-title":"Comput Fraud Secur"},{"key":"2560_CR44","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza JR, Katzenbeisser S, Celik M (2007) Privacy preserving error resilient DNA searching through oblivious automata. In: Proceedings of the 14th ACM conference on computer and communications security. ACM, pp 519\u2013528","DOI":"10.1145\/1315245.1315309"},{"issue":"7","key":"2560_CR45","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1038\/ng1562","volume":"37","author":"E Tuzun","year":"2005","unstructured":"Tuzun E, Sharp AJ, Bailey JA et al (2005) Fine-scale structural variation of the human genome. Nat Genet 37(7):727\u2013732","journal-title":"Nat Genet"},{"key":"2560_CR46","doi-asserted-by":"crossref","unstructured":"Van Lunteren J (2006) High-performance pattern-matching for intrusion detection. In: Proceedings of IEEE 25th international conference on computer communications (INFOCOM), 2006, pp 1\u201313","DOI":"10.1109\/INFOCOM.2006.204"},{"issue":"5507","key":"2560_CR47","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"JC Venter","year":"2001","unstructured":"Venter JC, Adams MD, Myers EW et al (2001) The sequence of the human genome. Science 291(5507):1304\u20131351","journal-title":"Science"},{"key":"2560_CR48","first-page":"41","volume-title":"Efficient and secure generalized pattern matching via fast fourier transform","author":"D Vergnaud","year":"2011","unstructured":"Vergnaud D (2011) Efficient and secure generalized pattern matching via fast fourier transform. International conference on cryptology in Africa. Springer, Berlin, pp 41\u201358"},{"key":"2560_CR49","doi-asserted-by":"crossref","unstructured":"Wang D, Jia X, Wang C et\u00a0al (2015) Generalized pattern matching string search on encrypted data in cloud systems. In: IEEE conference on computer Communications (INFOCOM). IEEE, pp 2101\u20132109","DOI":"10.1109\/INFOCOM.2015.7218595"},{"key":"2560_CR50","doi-asserted-by":"publisher","unstructured":"Wang H, He D, Shen J et\u00a0al (2016a) Verifiable outsourced ciphertext-policy attribute-based encryption in cloud computing. Soft Comput 1\u201311. doi: 10.1007\/s00500-016-2271-2","DOI":"10.1007\/s00500-016-2271-2"},{"key":"2560_CR51","doi-asserted-by":"crossref","unstructured":"Wang J, Miao M, Gao Y et al (2016b) Enabling efficient approximate nearest neighbor search for outsourced database in cloud computing[J]. Soft Comput 20(11):4487\u20134495","DOI":"10.1007\/s00500-015-1758-6"},{"key":"2560_CR52","doi-asserted-by":"crossref","unstructured":"Weiner P (1973) Linear pattern matching algorithms. In: Proceedings of the 14th annual symposium on switching and automata theory (swat 1973). IEEE Computer Society, pp 1\u201311","DOI":"10.1109\/SWAT.1973.13"},{"key":"2560_CR53","doi-asserted-by":"crossref","unstructured":"Wei L, Reiter MK (2012) Third-party private DFA evaluation on encrypted files in the cloud. In: European symposium on research in computer security. Springer, pp 523\u2013540","DOI":"10.1007\/978-3-642-33167-1_30"},{"key":"2560_CR54","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: Proceedings of the 23rd annual symposium on foundations of computer science (FOCS82). IEEE Computer Society, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2560-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2560-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2560-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T05:20:14Z","timestamp":1568956814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2560-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,29]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2560"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2560-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,3,29]]}}}