{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:30Z","timestamp":1740142770682,"version":"3.37.3"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"11","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972429"],"award-info":[{"award-number":["61972429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,11,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Recently, there has been renewed interest in conjunction obfuscations. A conjunction, which is called pattern matching with wildcards sometimes, is associated with a pattern $\\mathsf{pat}\\in \\{0,1,*\\}^n$ where * is a wildcard. It accepts if and only if the input bits are the same as the pattern at all non-wildcard positions. The conjunction obfuscation starts to get noticed because it provides the ability to protect these sensitive patterns while preserving its functionality. It is meaningful when the conjunction obfuscation is applied in the pattern matching, biological recognition, resisting SQL injection attacks and so on. In this work, we propose a new candidate of conjunction obfuscation. It not only retains the simplicity of the intuitive scheme in BKM18, but also adds wildcards to the pattern. Besides, we also propose a conjunction obfuscation with multi-bit output. The second obfuscation has the same size of the obfuscated program as the first obfuscation. Both obfuscations provide the distributional virtual black-box security.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac120","type":"journal-article","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T10:01:35Z","timestamp":1663668095000},"page":"2773-2781","source":"Crossref","is-referenced-by-count":0,"title":["New Obfuscation Scheme for Conjunctions"],"prefix":"10.1093","volume":"66","author":[{"given":"Zheng","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University , Guangzhou 510006, China"},{"name":"Guangdong Province Key Laboratory of Information Security Technology , Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University , Guangzhou 510006, China"},{"name":"Guangdong Province Key Laboratory of Information Security Technology , Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"2023111618464106300_ref1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/3406325.3451093","volume-title":"STOC\u201921: Proc. of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","author":"Jain","year":"2021"},{"key":"2023111618464106300_ref2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology - EUROCRYPT 2019. LNCS 11476","author":"Agrawal","year":"2019"},{"key":"2023111618464106300_ref3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/FOCS.2013.13","volume-title":"FOCS \u201813: Proc. of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science","author":"Garg","year":"2013"},{"key":"2023111618464106300_ref4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","volume-title":"Advances in Cryptology - CRYPTO 2015, LNCS","author":"Ananth","year":"2015"},{"key":"2023111618464106300_ref5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/FOCS.2015.20","volume-title":"FOCS \u201815: Proc. of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science","author":"Bitansky","year":"2015"},{"key":"2023111618464106300_ref6","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s00453-016-0242-8","article-title":"Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation","volume":"79","author":"Boneh","year":"2017","journal-title":"Algorithmica"},{"key":"2023111618464106300_ref7","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/2591796.2591825","volume-title":"STOC \u201814: Proc. of the Forty-Sixth Annual ACM Symposium on Theory of Computing","author":"Sahai","year":"2014"},{"key":"2023111618464106300_ref8","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1007\/s00453-016-0250-8","article-title":"Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications","volume":"79","author":"Yamakawa","year":"2017","journal-title":"Algorithmica"},{"key":"2023111618464106300_ref9","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 2001. LNCS","author":"Barak","year":"2001"},{"key":"2023111618464106300_ref10","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/1060590.1060669","volume-title":"STOC\u201905: Proc. of the 37th Annual ACM Symposium on Theory of Computing","author":"Wee","year":"2005"},{"key":"2023111618464106300_ref11","first-page":"142","volume-title":"Advances in Cryptology - ASIACRYPT 2014, LNCS","author":"Brzuska","year":"2014"},{"key":"2023111618464106300_ref12","first-page":"553","volume-title":"On the impossibility of obfuscation with auxiliary input, FOCS\u201905: 46th Annual IEEE Symposium on Foundations of Computer Science","author":"Goldwasser","year":"2005"},{"key":"2023111618464106300_ref13","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/FOCS.2017.61","volume-title":"FOCS \u201817: Proc. of the 2017 IEEE 58th Annual Symposium on Foundations of Computer Science","author":"Wichs","year":"2017"},{"key":"2023111618464106300_ref14","first-page":"81","volume-title":"TCC 2019: Theory of Cryptography, LNCS","author":"Galbraith","year":"2019"},{"key":"2023111618464106300_ref15","first-page":"26","article-title":"Obfuscation for evasive functions. TCC 14","volume":"8349","author":"Barak","year":"2014","journal-title":"LNCS"},{"volume-title":"SQL Injection Attacks and Defense","author":"Clarke","key":"2023111618464106300_ref16"},{"key":"2023111618464106300_ref17","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/978-3-642-40084-1_24","volume-title":"Advances in Cryptology - CRYPTO 2013, LNCS","author":"Brakerski","year":"2013"},{"key":"2023111618464106300_ref18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/2840728.2840764","volume-title":"ITCS 2016: Proc. of the 2016 ACM Conference on Innovations in Theoretical Computer Science","author":"Brakerski","year":"2016"},{"key":"2023111618464106300_ref19","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/FOCS.2017.62","volume-title":"FOCS \u201817: Proc. of the 2017 IEEE 58th Annual Symposium on Foundations of Computer Science","author":"Goyal","year":"2017"},{"key":"2023111618464106300_ref20","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/978-3-319-96878-0_25","volume-title":"Advances in Cryptology - CRYPTO 2018, LNCS","author":"Bishop","year":"2018"},{"key":"2023111618464106300_ref21","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/978-3-030-17659-4_22","volume-title":"Advances in Cryptology - EUROCRYPT 2019, LNCS","author":"Bartusek","year":"2019"},{"volume-title":"Pseudorandomness. Foundations and Trends in Theoretical Computer Science","author":"Vadhan","key":"2023111618464106300_ref22"},{"key":"2023111618464106300_ref23","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/jcss.1996.0004","article-title":"Randomness is linear in space","volume":"52","author":"Nisan","year":"1996","journal-title":"J. Comput. Syst. Sci."},{"key":"2023111618464106300_ref24","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/0022-314X(83)90044-6","article-title":"The Pjateckil-Sapiro prime number theorem","volume":"16","author":"Heath-Brown","year":"1983","journal-title":"J. Number Theory"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/11\/2773\/53401038\/bxac120.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/11\/2773\/53401038\/bxac120.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T18:47:15Z","timestamp":1700160435000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/11\/2773\/6695273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":24,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,9,19]]},"published-print":{"date-parts":[[2023,11,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac120","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,11]]},"published":{"date-parts":[[2022,9,19]]}}}