{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T05:51:50Z","timestamp":1773467510572,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hubei Province Major Science and Technology Innovation Program","award":["2024BAA011"],"award-info":[{"award-number":["2024BAA011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1109\/tbdata.2025.3640025","type":"journal-article","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:38:34Z","timestamp":1764873514000},"page":"643-660","source":"Crossref","is-referenced-by-count":0,"title":["Generation of Hard SAT Instances and Its Application in Negative Databases for Privacy Enhancement"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4697-6901","authenticated-orcid":false,"given":"Dongdong","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7060-6707","authenticated-orcid":false,"given":"Pang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changtian","family":"Song","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8440-4181","authenticated-orcid":false,"given":"Jianwen","family":"Xiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6094-1203","authenticated-orcid":false,"given":"Junwei","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zebo","family":"Tang","sequence":"additional","affiliation":[{"name":"Dongfeng Motor Corporation, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9927-9484","authenticated-orcid":false,"given":"Baogang","family":"Song","sequence":"additional","affiliation":[{"name":"School of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/BigDataSecurity-HPSC-IDS.2019.00063"},{"issue":"11","key":"ref2","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Found. Secure Comput."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.21236\/ADA498766"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-007-0030-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2008.919079"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/25"},{"key":"ref8","first-page":"440","article-title":"A new method for solving hard satisfiability problems","volume-title":"Proc. Tenth Nat. Conf. Artif. Intell.","author":"Selman"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"issue":"1","key":"ref10","first-page":"6","article-title":"A review of research on algorithms for solving SAT problems","volume-title":"Math. Model. Algorithm Appl.","volume":"2","author":"Guo","year":"2024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10439"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1410"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3152"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00045-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2039"},{"issue":"1","key":"ref17","first-page":"43","article-title":"The P-hidden Algorithm: Hiding single databases more deeply","volume":"2","author":"Liu","year":"2014","journal-title":"Immune Comput."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/aisw.2015.7469244"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.05.010"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107732"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1558607.1558654"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.11.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2507133"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2015.09.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-013-2318-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04212-7_17"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32591-6_7"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIS55630.2022.00026"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"ref30","article-title":"Conflict-driven clause learning","volume":"336","author":"Solvers","year":"2021","journal-title":"Handbook Satisfiability"},{"key":"ref31","first-page":"53","article-title":"Balanced random sat benchmarks","volume-title":"Proc. SAT Competition\u2013Solver Benchmark Descriptions"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3385651"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3424978.3425118"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04602-2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.244"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/WIECON-ECE60392.2023.10456447"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00244"},{"key":"ref38","article-title":"Cadical_rel_scavel and cadical_rel_1.5.3_scavel","volume-title":"Proc. SAT Compet. 2023: Solver Benchmark Descriptions","author":"Li"},{"key":"ref39","first-page":"14","article-title":"CaDiCaL_vivinst, IsaSAT, Gimsatul, Kissat, and TabularaSAT entering the sat competition 2023","volume-title":"Proc. SAT Competition 2023: Solver Benchmark Descriptions","author":"Biere"},{"key":"ref40","first-page":"21","article-title":"SEQFROST at the SAT competition 2023","volume-title":"Proc. SAT Competition 2023: Solver Benchmark Descriptions","author":"Osama"},{"key":"ref41","article-title":"Iris","author":"Fisher","year":"1936","journal-title":"UCI Mach. Learn. Repository"},{"key":"ref42","article-title":"Wine","author":"Aeberhard","year":"1992","journal-title":"UCI Mach. Learn. Repository"},{"key":"ref43","article-title":"Seeds","author":"Charytanowicz","year":"2010","journal-title":"UCI Mach. Learn. Repository"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.1979.4766909"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref46","article-title":"Unsupervised representation learning with deep convolutional generative adversarial networks","author":"Radford","year":"2016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11433832\/11278024.pdf?arnumber=11278024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T04:58:30Z","timestamp":1773464310000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11278024\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":47,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2025.3640025","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]}}}