{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:42:05Z","timestamp":1742946125902,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031226762"},{"type":"electronic","value":"9783031226779"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-22677-9_25","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:04:32Z","timestamp":1673341472000},"page":"471-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SMTWM: Secure Multiple Types Wildcard Pattern Matching Protocol from\u00a0Oblivious Transfer"],"prefix":"10.1007","author":[{"given":"Shuang","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochao","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/TDSC.2017.2763593","volume":"16","author":"M Kim","year":"2019","unstructured":"Kim, M., Lee, H.T., Ling, S., Tan, B.H.M., Wang, H.: Private compound wildcard queries using fully homomorphic encryption. IEEE Trans. Dependable Secur. Comput. 16(5), 743\u2013756 (2019)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1515\/popets-2015-0014","volume":"2015","author":"M Chase","year":"2015","unstructured":"Chase, M., Shen, E.: Substring-searchable symmetric encryption. Proc. Priv. Enhancing Technol. 2015(2), 263\u2013281 (2015)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-24177-7_7","volume-title":"Computer Security \u2013 ESORICS 2015","author":"S Faber","year":"2015","unstructured":"Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosu, M., Steiner, M.: Rich queries on encrypted data: beyond exact matches. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015, Part II. LNCS, vol. 9327, pp. 123\u2013145. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24177-7_7"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., Koshiba, T.: Secure pattern matching using somewhat homomorphic encryption. In: Juels, A., Parno, B. (eds.) CCSW 2013, Proceedings of the 2013 ACM Cloud Computing Security Workshop, Co-located with CCS 2013, Berlin, Germany, 4 November 2013, pp. 65\u201376. ACM (2013)","DOI":"10.1145\/2517488.2517497"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-319-08344-5_22","volume-title":"Information Security and Privacy","author":"M Yasuda","year":"2014","unstructured":"Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., Koshiba, T.: Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 338\u2013353. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08344-5_22"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-03007-9_6","volume-title":"Data and Applications Security XXIII","author":"KB Frikken","year":"2009","unstructured":"Frikken, K.B.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: Gudes, E., Vaidya, J. (eds.) DBSec 2009. LNCS, vol. 5645, pp. 81\u201394. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03007-9_6"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.U.: Privacy preserving error resilient DNA searching through oblivious automata. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, 28\u201331 October 2007, pp. 519\u2013528. ACM (2007)","DOI":"10.1145\/1315245.1315309"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-13739-6_4","volume-title":"Data and Applications Security and Privacy XXIV","author":"M Blanton","year":"2010","unstructured":"Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: Foresti, S., Jajodia, S. (eds.) DBSec 2010. LNCS, vol. 6166, pp. 49\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13739-6_4"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Katz, J., Malka, L.: Secure text processing with applications to private DNA matching. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, Chicago, Illinois, USA, 4\u20138 October 2010, pp. 485\u2013492. ACM (2010)","DOI":"10.1145\/1866307.1866361"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-32928-9_13","volume-title":"Security and Cryptography for Networks","author":"J Baron","year":"2012","unstructured":"Baron, J., El Defrawy, K., Minkovich, K., Ostrovsky, R., Tressler, E.: 5PM: secure pattern matching. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 222\u2013240. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32928-9_13"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Beck, M., Kerschbaum, F.: Approximate two-party privacy-preserving string matching with linear complexity. In: IEEE International Congress on Big Data, BigData Congress 2013, Santa Clara, CA, USA, 27 June 2013\u20132 July 2013, pp. 31\u201337. IEEE Computer Society (2013)","DOI":"10.1109\/BigData.Congress.2013.14"},{"issue":"12","key":"25_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MC.2013.73","volume":"46","author":"KE Defrawy","year":"2013","unstructured":"Defrawy, K.E., Faber, S.: Blindfolded data search via secure pattern matching. Computer 46(12), 68\u201375 (2013)","journal-title":"Computer"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-17373-8_12","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Toft, T.: Computationally secure pattern matching in the presence of malicious adversaries. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 195\u2013212. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_12"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Cachin, C., Ristenpart, T. (eds.) Proceedings of the 3rd ACM Cloud Computing Security Workshop, CCSW 2011, Chicago, IL, USA, 21 October 2011, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"issue":"2","key":"25_CR15","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":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-662-58387-6_12","volume-title":"Financial Cryptography and Data Security","author":"V Kolesnikov","year":"2018","unstructured":"Kolesnikov, V., Rosulek, M., Trieu, N.: SWiM: secure wildcard pattern matching from OT extension. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 222\u2013240. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_12"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ins.2020.03.087","volume":"529","author":"X Wei","year":"2020","unstructured":"Wei, X., Xu, L., Zhao, M., Wang, H.: Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer. Inf. Sci. 529, 132\u2013140 (2020)","journal-title":"Inf. Sci."},{"key":"25_CR18","volume":"55","author":"TK Saha","year":"2020","unstructured":"Saha, T.K., Rathee, D., Koshiba, T.: Effcient protocols for private wildcards pattern matching. J. Inf. Secur. Appl. 55, 102609 (2020)","journal-title":"J. Inf. Secur. Appl."},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-01957-9_7","volume-title":"Applied Cryptography and Network Security","author":"A Jarrous","year":"2009","unstructured":"Jarrous, A., Pinkas, B.: Secure hamming distance based computation and its applications. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 107\u2013124. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01957-9_7"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-21969-6_3","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"D Vergnaud","year":"2011","unstructured":"Vergnaud, D.: Efficient and secure generalized pattern matching via fast fourier transform. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 41\u201358. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_3"},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s00500-017-2560-4","volume":"22","author":"X Wei","year":"2018","unstructured":"Wei, X., Zhao, M., Xu, Q.: Efficient and secure outsourced approximate pattern matching protocol. Soft. Comput. 22(4), 1175\u20131187 (2018)","journal-title":"Soft. Comput."},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.3233\/IDA-205087","volume":"25","author":"N Liu","year":"2021","unstructured":"Liu, N., Xie, F., Wu, X.: Suffx array for multi-pattern matching with variable length wildcards. Intell. Data Anal. 25(2), 283\u2013303 (2021)","journal-title":"Intell. Data Anal."},{"key":"25_CR23","unstructured":"Vaiwsri, S., Ranbaduge, T., Christen, P., Ng, K.S.: Accurate and efficient suffix tree based privacy-preserving string matching, CoRR abs\/2104.03018 (2021). arXiv:2104.03018"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10207-017-0374-0","volume":"17","author":"S Faust","year":"2018","unstructured":"Faust, S., Hazay, C., Venturi, D.: Outsourced pattern matching. Int. J. Inf. Secur. 17(3), 327\u2013346 (2018)","journal-title":"Int. J. Inf. Secur."},{"issue":"16","key":"25_CR25","doi-asserted-by":"publisher","first-page":"3444","DOI":"10.1002\/sec.1552","volume":"9","author":"D Li","year":"2016","unstructured":"Li, D., Dong, X., Cao, Z.: Secure and privacy-preserving pattern matching in outsourced computing. Secur. Commun. Netw. 9(16), 3444\u20133451 (2016)","journal-title":"Secur. Commun. Netw."},{"key":"25_CR26","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-59608-2_11","volume-title":"Security and Privacy in Communication Networks","author":"T Zhang","year":"2017","unstructured":"Zhang, T., Wang, X., Chow, S.S.M.: Privacy-preserving multi-pattern matching. In: Deng, R., Weng, J., Ren, K., Yegneswaran, V. (eds.) SecureComm 2016. LNICST, vol. 198, pp. 199\u2013218. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59608-2_11"},{"issue":"5","key":"25_CR27","first-page":"2253","volume":"18","author":"J Zhou","year":"2021","unstructured":"Zhou, J., Choo, K.R., Cao, Z., Dong, X.: PVOPM: verifiable privacy-preserving pattern matching with efficient outsourcing in the malicious setting. IEEE Trans. Dependable Secur. Comput. 18(5), 2253\u20132270 (2021)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"25_CR28","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive 450\/187 (2005)"},{"key":"25_CR29","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, USA, pp. 218\u2013229. ACM, New York (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"25_CR31","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":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M.: Efficient batched oblivious PRF with application to private set intersection. In: Proceedings of the 23rd ACM SIGSAC Conference on Computer and Communications Security, pp. 818\u2013829. ACM, New York (2016)","DOI":"10.1145\/2976749.2978381"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22677-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T22:41:18Z","timestamp":1728686478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22677-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031226762","9783031226779"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22677-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}