{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:28:36Z","timestamp":1777868916081,"version":"3.51.4"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115841","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T07:58:46Z","timestamp":1772524726000},"page":"115841","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Matchmaking encryption for NC1 circuits without obfuscation"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-651X","authenticated-orcid":false,"given":"Ying","family":"Gao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7150-411X","authenticated-orcid":false,"given":"Xinrui","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6757-6416","authenticated-orcid":false,"given":"Jie","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1137-9605","authenticated-orcid":false,"given":"Yijian","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6932-7667","authenticated-orcid":false,"given":"Yu","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115841_bib0001","series-title":"2003 Symposium on Security and Privacy, 2003.","first-page":"180","article-title":"Secret handshakes from pairing-based key agreements","author":"Balfanz","year":"2003"},{"key":"10.1016\/j.tcs.2026.115841_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-021-09381-4","article-title":"Match me if you can: matchmaking encryption and its applications","volume":"34","author":"Ateniese","year":"2021","journal-title":"J. Cryptol."},{"key":"10.1016\/j.tcs.2026.115841_bib0003","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"573","article-title":"Multi-key and multi-input predicate encryption from learning with errors","author":"Francati","year":"2023"},{"key":"10.1016\/j.tcs.2026.115841_bib0004","series-title":"European Symposium on Research in Computer Security","first-page":"425","article-title":"Identity-based matchmaking encryption with enhanced privacy\u2013A generic construction with practical instantiations","author":"Boyen","year":"2023"},{"key":"10.1016\/j.tcs.2026.115841_bib0005","series-title":"International Conference on the Theory and Application of Cryptology and Information Security","first-page":"394","article-title":"Identity-based matchmaking encryption from standard assumptions","author":"Chen","year":"2022"},{"key":"10.1016\/j.tcs.2026.115841_bib0006","series-title":"International Conference on Cryptology in India","first-page":"415","article-title":"Identity-based matchmaking encryption without random oracles","author":"Francati","year":"2021"},{"issue":"1","key":"10.1016\/j.tcs.2026.115841_bib0007","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/TDSC.2024.3418984","article-title":"Post-quantum secure identity-based matchmaking encryption","volume":"22","author":"Wang","year":"2025","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.115841_bib0008","first-page":"1064","article-title":"Match in my way: fine-grained bilateral access control for secure cloud-fog computing","volume":"19","author":"Xu","year":"2020","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"11","key":"10.1016\/j.tcs.2026.115841_bib0009","first-page":"13969","article-title":"Lightweight and bilateral controllable data sharing for secure autonomous vehicles platooning service","volume":"72","author":"Bao","year":"2023","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"6","key":"10.1016\/j.tcs.2026.115841_bib0010","doi-asserted-by":"crossref","first-page":"4444","DOI":"10.1109\/TSC.2023.3324736","article-title":"Catch me if you can: a secure bilateral access control system with anonymous credentials","volume":"16","author":"Ma","year":"2023","journal-title":"IEEE Trans. Serv. Comput."},{"key":"10.1016\/j.tcs.2026.115841_bib0011","doi-asserted-by":"crossref","first-page":"5286","DOI":"10.1109\/TIFS.2023.3303720","article-title":"Secure cloud-assisted data pub\/sub service with fine-grained bilateral access control","volume":"18","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.tcs.2026.115841_bib0012","series-title":"Annual International Cryptology Conference","first-page":"590","article-title":"Multi-input attribute based encryption and predicate encryption","author":"Agrawal","year":"2022"},{"key":"10.1016\/j.tcs.2026.115841_bib0013","series-title":"Annual Cryptology Conference","first-page":"503","article-title":"Predicate encryption for circuits from LWE","author":"Gorbunov","year":"2015"},{"key":"10.1016\/j.tcs.2026.115841_bib0014","series-title":"Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part I 18","first-page":"149","article-title":"Optimal broadcast encryption from LWE and pairings in the standard model","author":"Agrawal","year":"2020"},{"key":"10.1016\/j.tcs.2026.115841_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.115048","article-title":"Identity-based matchmaking encryption with stronger security and instantiation on lattices","volume":"1029","author":"Wang","year":"2025","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115841_bib0016","series-title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"612","article-title":"Lockable obfuscation","author":"Goyal","year":"2017"},{"key":"10.1016\/j.tcs.2026.115841_bib0017","unstructured":"D.F. Aranha, RELIC is an efficient library for cryptography, http:\/\/code.google.com\/p\/relic-toolkit\/ (2020)."},{"key":"10.1016\/j.tcs.2026.115841_bib0018","series-title":"2011 IEEE Symposium on Computers and Communications (ISCC)","first-page":"850","article-title":"jPBC: java pairing based cryptography","author":"De Caro","year":"2011"},{"issue":"3","key":"10.1016\/j.tcs.2026.115841_bib0019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2633600","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski","year":"2014","journal-title":"ACM Trans. Comput. Theory"},{"key":"10.1016\/j.tcs.2026.115841_bib0020","series-title":"Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I","first-page":"75","article-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","author":"Gentry","year":"2013"},{"key":"10.1016\/j.tcs.2026.115841_bib0021","series-title":"Advances in Cryptology\u2013EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11\u201315, 2014. Proceedings 33","first-page":"533","article-title":"Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits","author":"Boneh","year":"2014"},{"key":"10.1016\/j.tcs.2026.115841_bib0022","series-title":"Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34","first-page":"297","article-title":"Faster bootstrapping with polynomial error","author":"Alperin-Sheriff","year":"2014"},{"key":"10.1016\/j.tcs.2026.115841_bib0023","series-title":"Public-Key Cryptography\u2013PKC 2019: 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14\u201317, 2019, Proceedings, Part II 22","first-page":"254","article-title":"Obfuscating simple functionalities from knowledge assumptions","author":"Beullens","year":"2019"},{"key":"10.1016\/j.tcs.2026.115841_bib0024","series-title":"Applied Cryptography and Network Security: 7th International Conference, ACNS 2009, Paris-Rocquencourt, France, June 2\u20135, 2009. Proceedings 7","first-page":"168","article-title":"Dual-policy attribute based encryption","author":"Attrapadung","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2026.115841_bib0025","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1587\/transfun.E93.A.116","article-title":"Dual-policy attribute based encryption: simultaneous access control with ciphertext and key policies","volume":"93","author":"Attrapadung","year":"2010","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115841_bib0026","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s00145-024-09504-7","article-title":"Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors","volume":"37","author":"Francati","year":"2024","journal-title":"J. Cryptol."},{"key":"10.1016\/j.tcs.2026.115841_bib0027","series-title":"2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"600","article-title":"Obfuscating compute-and-compare programs under LWE","author":"Wichs","year":"2017"},{"key":"10.1016\/j.tcs.2026.115841_bib0028","series-title":"Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, the Netherlands, February 21\u201324, 2007. Proceedings 4","first-page":"535","article-title":"Conjunctive, subset, and range queries on encrypted data","author":"Boneh","year":"2007"},{"key":"10.1016\/j.tcs.2026.115841_bib0029","series-title":"Advances in Cryptology\u2013EUROCRYPT 2008: 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13\u201317, 2008. Proceedings 27","first-page":"146","article-title":"Predicate encryption supporting disjunctions, polynomial equations, and inner products","author":"Katz","year":"2008"},{"issue":"6","key":"10.1016\/j.tcs.2026.115841_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.tcs.2026.115841_bib0031","series-title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing","first-page":"333","article-title":"Public-key cryptosystems from the worst-case shortest vector problem","author":"Peikert","year":"2009"},{"key":"10.1016\/j.tcs.2026.115841_bib0032","series-title":"Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing","first-page":"197","article-title":"Trapdoors for hard lattices and new cryptographic constructions","author":"Gentry","year":"2008"},{"key":"10.1016\/j.tcs.2026.115841_bib0033","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"700","article-title":"Trapdoors for lattices: simpler, tighter, faster, smaller","author":"Micciancio","year":"2012"},{"key":"10.1016\/j.tcs.2026.115841_bib0034","series-title":"Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29","first-page":"553","article-title":"Efficient lattice (H) IBE in the standard model","author":"Agrawal","year":"2010"},{"key":"10.1016\/j.tcs.2026.115841_bib0035","series-title":"International Conference on the Theory and Application of Cryptology and Information Security","first-page":"550","article-title":"Riding on asymmetry: efficient ABE for branching programs","author":"Gorbunov","year":"2015"},{"key":"10.1016\/j.tcs.2026.115841_bib0036","series-title":"Annual International Cryptology Conference","first-page":"67","article-title":"Practical functional encryption for quadratic functions with applications to predicate encryption","author":"Baltico","year":"2017"},{"key":"10.1016\/j.tcs.2026.115841_bib0037","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"247","article-title":"Compact adaptively secure ABE from k-Lin: beyond and towards","author":"Lin","year":"2020"},{"key":"10.1016\/j.tcs.2026.115841_bib0038","series-title":"2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"11","article-title":"Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings","author":"Lin","year":"2016"},{"key":"10.1016\/j.tcs.2026.115841_bib0039","series-title":"Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I 34","first-page":"335","article-title":"Improved short lattice signatures in the standard model","author":"Ducas","year":"2014"},{"issue":"3","key":"10.1016\/j.tcs.2026.115841_bib0040","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00145-019-09324-0","article-title":"Multi-theorem preprocessing NIZKs from lattices","volume":"33","author":"Kim","year":"2020","journal-title":"J. Cryptol."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001003?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001003?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:52:04Z","timestamp":1777553524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":40,"alternative-id":["S0304397526001003"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115841","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Matchmaking encryption for NC1 circuits without obfuscation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115841","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115841"}}