{"id":"https://openalex.org/W4389779327","doi":"https://doi.org/10.1109/dsc61021.2023.10354147","title":"Secure Outsourcing of Boolean Formulas Truth Assignment Problem","display_name":"Secure Outsourcing of Boolean Formulas Truth Assignment Problem","publication_year":2023,"publication_date":"2023-11-07","ids":{"openalex":"https://openalex.org/W4389779327","doi":"https://doi.org/10.1109/dsc61021.2023.10354147"},"language":"en","primary_location":{"id":"doi:10.1109/dsc61021.2023.10354147","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/dsc61021.2023.10354147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Conference on Dependable and Secure Computing (DSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028729530","display_name":"Albert Guan","orcid":null},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Albert Guan","raw_affiliation_strings":["National Taiwan Normal University,Department of Computer Science and Information Engineering,Taipei,Taiwan,11677"],"affiliations":[{"raw_affiliation_string":"National Taiwan Normal University,Department of Computer Science and Information Engineering,Taipei,Taiwan,11677","institution_ids":["https://openalex.org/I134161618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028729530"],"corresponding_institution_ids":["https://openalex.org/I134161618"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17304772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7110262513160706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616310477256775},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5919824242591858},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5469553470611572},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5446322560310364},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.5429768562316895},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5221431851387024},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5199797749519348},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5175380110740662},{"id":"https://openalex.org/keywords/outsourcing","display_name":"Outsourcing","score":0.5170667767524719},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.4904000759124756},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.48223695158958435},{"id":"https://openalex.org/keywords/digital-electronics","display_name":"Digital electronics","score":0.4755277931690216},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4576694965362549},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.45744678378105164},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.4298518896102905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32112830877304077},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.246842622756958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2440737783908844},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.22346609830856323}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7110262513160706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616310477256775},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5919824242591858},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5469553470611572},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5446322560310364},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.5429768562316895},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5221431851387024},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5199797749519348},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5175380110740662},{"id":"https://openalex.org/C46934059","wikidata":"https://www.wikidata.org/wiki/Q61515","display_name":"Outsourcing","level":2,"score":0.5170667767524719},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.4904000759124756},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.48223695158958435},{"id":"https://openalex.org/C81843906","wikidata":"https://www.wikidata.org/wiki/Q173156","display_name":"Digital electronics","level":3,"score":0.4755277931690216},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4576694965362549},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.45744678378105164},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.4298518896102905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32112830877304077},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.246842622756958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2440737783908844},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.22346609830856323},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsc61021.2023.10354147","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/dsc61021.2023.10354147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Conference on Dependable and Secure Computing (DSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1546943373","https://openalex.org/W1547671177","https://openalex.org/W1569499052","https://openalex.org/W1571821840","https://openalex.org/W1975199330","https://openalex.org/W2076169792","https://openalex.org/W2132220327","https://openalex.org/W2133527541","https://openalex.org/W2145166073","https://openalex.org/W2155151982","https://openalex.org/W2170444562","https://openalex.org/W2620600500","https://openalex.org/W4252614677"],"related_works":["https://openalex.org/W1996276855","https://openalex.org/W2567187083","https://openalex.org/W4237556422","https://openalex.org/W2234833091","https://openalex.org/W1496352327","https://openalex.org/W2059955066","https://openalex.org/W1568384982","https://openalex.org/W1745650241","https://openalex.org/W4241989857","https://openalex.org/W1999154139"],"abstract_inverted_index":{"Finding":[0],"truth":[1,25,65],"assignment":[2,26,66],"of":[3,16,23,37,67,79,115],"Boolean":[4,28,68,80],"formulas":[5,81],"has":[6],"many":[7],"practical":[8,52],"applications,":[9],"such":[10,88],"as":[11,89],"graph":[12],"coloring":[13],"and":[14,77,105],"verification":[15],"combinatorial":[17],"logic":[18],"circuit.":[19],"However,":[20],"the":[21,34,75,102,106,113],"problem":[22,48],"computing":[24,35],"for":[27,54,63],"formula":[29],"is":[30,50,108,121],"NP-hard.":[31],"Therefore,":[32],"using":[33],"resources":[36],"cloud":[38],"services":[39],"to":[40],"solve":[41],"satisfiability":[42],"problems":[43],"faster":[44],"or":[45],"with":[46,94],"larger":[47],"size":[49,114],"a":[51,59],"approach":[53],"these":[55],"applications.":[56],"We":[57],"proposed":[58,71],"secure":[60],"outsourcing":[61],"scheme":[62,72],"finding":[64],"formulas.":[69],"The":[70],"can":[73,99],"hide":[74],"structure":[76],"solutions":[78],"that":[82],"might":[83],"otherwise":[84],"reveal":[85],"original":[86,103],"designs,":[87],"advanced":[90],"digital":[91],"circuits.":[92],"Compared":[93],"other":[95],"methods,":[96],"our":[97],"method":[98,120],"better":[100],"protect":[101],"design,":[104],"performance":[107],"not":[109],"seriously":[110],"affected":[111],"because":[112],"all":[116],"transformations":[117],"in":[118],"this":[119],"linear.":[122]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}