{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T07:46:39Z","timestamp":1743579999927,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M632712"],"award-info":[{"award-number":["2018M632712"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802235","61602287"],"award-info":[{"award-number":["61802235","61602287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014103","name":"Key Technology Research and Development Program of Shandong","doi-asserted-by":"publisher","award":["2018GGX101037"],"award-info":[{"award-number":["2018GGX101037"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Innovation Project of Science and Technology in Shandong Province","award":["2018CXGC0702"],"award-info":[{"award-number":["2018CXGC0702"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2967812","type":"journal-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T12:32:14Z","timestamp":1579609934000},"page":"17378-17389","source":"Crossref","is-referenced-by-count":5,"title":["Permutable Cut-and-Choose Oblivious Transfer and Its Application"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4433-1322","authenticated-orcid":false,"given":"Xiaochao","family":"Wei","sequence":"first","affiliation":[]},{"given":"Lin","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3472-3699","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhihua","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"36","article-title":"Garbled circuits checking garbled circuits: More efficient and secure two-party computation","volume":"8043","author":"mohassel","year":"2013","journal-title":"Adv Cryptology"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref15","first-page":"145","article-title":"Extending oblivious transfers efficiently","author":"ishai","year":"2003","journal-title":"Proc Annu Int Cryptol Conf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_17"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.398"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2016.0092"},{"key":"ref19","first-page":"554","article-title":"A framework for efficient and composable oblivious transfer","author":"peikert","year":"2008","journal-title":"Proc Int Cryptol Conf"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2560-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"journal-title":"SWiM Secure Wildcard Pattern Matching From OT Extension","year":"2017","author":"kolesnikov","key":"ref27"},{"key":"ref3","first-page":"218","article-title":"How to play any mental game—A completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"Proc 19th STOC"},{"article-title":"How to exchange secrets by oblivious transfer","year":"1981","author":"rabin","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2018.01.004"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14303-8","author":"hazay","year":"2010","journal-title":"Efficient Secure Two-Party Protocols Techniques and Constructions"},{"key":"ref8","first-page":"1","article-title":"Fast cut-and-choose based protocols for malicious and covert adversaries","volume":"8043","author":"lindell","year":"2013","journal-title":"Adv Cryptology"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-19571-6_20","article-title":"Secure two-party computation via cut-and-choose oblivious transfer","volume":"6597","author":"lindell","year":"2011","journal-title":"Theory of Cryptography"},{"key":"ref2","first-page":"162","article-title":"How to generate and exchange secrets","author":"yao","year":"1986","journal-title":"Proc 27th Annu Symp Foundations of Computer Science (FOCS)"},{"key":"ref9","first-page":"18","article-title":"Efficient secure two-party computation using symmetric cut-and-choose","volume":"8043","author":"huang","year":"2013","journal-title":"Adv Cryptology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref20","first-page":"137","article-title":"Secure outsourced garbled circuit evaluation for mobile devices","author":"carter","year":"2013","journal-title":"Proc Usenix Secur Symp"},{"key":"ref22","first-page":"41","article-title":"Efficient and secure generalized pattern matching via fast Fourier transform","author":"vergnaud","year":"2011","journal-title":"Proc Intl Conf Comm"},{"key":"ref21","first-page":"195","article-title":"Computationally secure pattern matching in the presence of malicious adversaries","author":"hazay","year":"2010","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur (ASIACRYPT)"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-319-08344-5_22","article-title":"Privacy-preserving wildcards pattern matching using symmetric somewhat homomorphic encryption","volume":"8544","author":"yasuda","year":"2014","journal-title":"Information Security and Privacy"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-642-32928-9_13","article-title":"5pm: Secure pattern matching","author":"baron","year":"2012","journal-title":"Proc Int Conf Secur Cryptograph Netw"},{"key":"ref26","first-page":"145","author":"saha","year":"2017","journal-title":"An Enhancement of Privacy-Preserving Wildcards Pattern Matching"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2517488.2517497"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08963650.pdf?arnumber=8963650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T20:16:42Z","timestamp":1643314602000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8963650\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967812","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}