{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:21:06Z","timestamp":1725992466296},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030016883"},{"type":"electronic","value":"9783030016890"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01689-0_18","type":"book-chapter","created":{"date-parts":[[2018,9,22]],"date-time":"2018-09-22T07:22:22Z","timestamp":1537600942000},"page":"224-239","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation"],"prefix":"10.1007","author":[{"given":"Ying","family":"Qin","sequence":"first","affiliation":[]},{"given":"Xiao Yang","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Zhen Yue","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,23]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"18_CR2","first-page":"1","volume-title":"Logic Synthesis and Verification Algorithms","author":"G Hachtel","year":"2006","unstructured":"Hachtel, G., Somenzi, F.: Logic Synthesis and Verification Algorithms, vol. I-XXIII, pp. 1\u2013564. Springer, Heidelberg (2006)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-23786-7_30","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"AEJ Hyv\u00e4rinen","year":"2011","unstructured":"Hyv\u00e4rinen, A.E.J., Junttila, T., Niemel\u00e4, I.: Grid-based SAT solving with iterative partitioning and clause learning. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 385\u2013399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_30"},{"key":"18_CR6","unstructured":"Tseitin, G.: On the complexity of derivation in propositional calculus. Stud. Constr. Math. Math. Logic (1968)"},{"key":"18_CR7","unstructured":"Li, C.: Integrating equivalency reasoning into Davis-Putnam procedure. In: AAAI\/IAAI 2000, pp. 291\u2013296 (2000)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-46135-3_13","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"R Ostrowski","year":"2002","unstructured":"Ostrowski, R., Gr\u00e9goire, \u00c9., Mazure, B., Sa\u00efs, L.: Recovering and exploiting structural knowledge from CNF formulas. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 185\u2013199. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_13"},{"key":"18_CR9","unstructured":"Roy, J., Markov, I., Bertacco, V.: Restoring circuit structure from SAT instances. In: IWLS 2004, pp. 361\u2013368 (2004)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: Extracting logic circuit structure from conjunctive normal form descriptions. In: VLSI Design, pp. 37\u201342 (2007)","DOI":"10.1109\/VLSID.2007.81"},{"key":"18_CR11","unstructured":"MiniSat-SAT Algorithms and Applications Invited talk given by Niklas Sorensson at the CADE-20 workshop ESCAR. http:\/\/minisat.se\/Papers.html"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Balduzzi, M., Zaddach, J., Balzarotti, D., Kirda, E., Loureiro, S.: A security analysis of Amazon\u2019s elastic compute cloud service. In: SAC 2012, pp. 1427\u20131434 (2012)","DOI":"10.1145\/2245276.2232005"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Ristenpart, T., Tromer, E., Shacham, H., Savage, S.: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In: CCS 2009, pp. 199\u2013212 (2009)","DOI":"10.1145\/1653662.1653687"},{"key":"18_CR14","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: AAAI\/IAAI 2000, pp. 256\u2013261 (2000)"},{"key":"18_CR15","unstructured":"Jarvisalo, M.: Equivalence checking hardware multiplier designs. SAT Competition 2007 Benchmark Description"},{"key":"18_CR16","unstructured":"Pyhala, T.: Factoring Benchmark for SAT-solvers. http:\/\/www.tcs.hut.fi\/Software\/genfacbm\/"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Rothblum, G.: Black-box obfuscation for d-CNFs. In: ITCS 2014, pp. 235\u2013250 (2014)","DOI":"10.1145\/2554797.2554820"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11496137_9","volume-title":"Applied Cryptography and Network Security","author":"W Du","year":"2005","unstructured":"Du, W., Goodrich, M.T.: Searching for high-value rare events with uncheatable grid computing. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 122\u2013137. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_9"},{"key":"18_CR19","unstructured":"Paralleling OpenSMT Towards Cloud Computing. http:\/\/www.inf.usi.ch\/urop-Tsitovich-2-127208.pdf"},{"key":"18_CR20","unstructured":"Formal in the Cloud OneSpin: New Spin on Cloud Computing. http:\/\/www.eejournal.com\/archives\/articles\/20130627-onespin\/?printView=true"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, X., He, F., Zuo, W.: Theory and practice of program obfuscation. In: Crisan, M. (ed.) Convergence and Hybrid Information Technologies, p. 426. INTECH, Croatia, March 2010. ISBN 978-953-307-068-1","DOI":"10.5772\/9632"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: application in VLSI domain. In: DAC 1997, pp. 526\u2013529 (1997)","DOI":"10.1145\/266021.266273"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-30579-8_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"SY Shen","year":"2005","unstructured":"Shen, S.Y., Qin, Y., Li, S.K.: Minimizing counterexample with unit core extraction and incremental SAT. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 298\u2013312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_20"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-11119-3_18","volume-title":"Web Technologies and Applications","author":"Y Qin","year":"2014","unstructured":"Qin, Y., Shen, S., Kong, J., Dai, H.: Cloud-oriented SAT solver based on obfuscating CNF formula. In: Han, W., Huang, Z., Hu, C., Zhang, H., Guo, L. (eds.) APWeb 2014. LNCS, vol. 8710, pp. 188\u2013199. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11119-3_18"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Qin, Y., Shen, S.Y., Jia, Y.: Structure-aware CNF obfuscation for privacy-preserving SAT solving. In: MEMOCODE 2014, pp. 84\u201393 (2014)","DOI":"10.1109\/MEMCOD.2014.6961846"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2013.09.028","volume":"32","author":"X Li","year":"2014","unstructured":"Li, X., Wang, H., Ding, B., Li, X., Feng, D.: Resource allocation with multi-factor node ranking in data center networks. Futur. Gener. Comput. Syst. 32, 1\u201312 (2014). https:\/\/doi.org\/10.1016\/j.future.2013.09.028","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"4","key":"18_CR27","doi-asserted-by":"publisher","first-page":"49:1","DOI":"10.1145\/2847562","volume":"48","author":"Y Ren","year":"2016","unstructured":"Ren, Y., Liu, L., Zhang, Q., Wu, Q., Guan, J., Kong, J., Dai, H., Shao, L.: Shared-memory optimizations for inter-virtual-machine communication. ACM Comput. Surv. 48(4), 49:1\u201349:42 (2016). https:\/\/doi.org\/10.1145\/2847562","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Cyberspace Safety and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01689-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T13:06:05Z","timestamp":1571922365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01689-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030016883","9783030016890"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01689-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyberspace Safety and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"css2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/css2018.di.unisa.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}