{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:00:56Z","timestamp":1725508856002},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/globalsip.2017.8309184","type":"proceedings-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T16:33:04Z","timestamp":1520872384000},"page":"1363-1367","source":"Crossref","is-referenced-by-count":0,"title":["A hybrid encryption scheme based on the satisfiability problem"],"prefix":"10.1109","author":[{"given":"Rui","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youliang","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_26"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88733-1_5"},{"key":"ref12","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"stephen","year":"1971","journal-title":"ACM Symposium on Theory of Computing May 3-5 Shaker Heights Ohio Usa DBLP"},{"key":"ref13","first-page":"616","article-title":"Using 3-SAT NP-Hard Problem to Improve the Security of Visual Zero-Knowledge Proof of Identity Scheme","author":"jaafar","year":"2012","journal-title":"European Journal of Scientific Research"},{"key":"ref14","first-page":"1","article-title":"A SAT-based Public Key Cryptography Scheme","author":"sebastian","year":"2015","journal-title":"Computer Science"},{"key":"ref15","first-page":"1","author":"thomas","year":"2011","journal-title":"Hybrid Cryptosystem based on 2-SAT & 3-SAT and the implications of polynomial solvability of 3-SAT"},{"key":"ref16","article-title":"The Satisfiability Threshold of Random 3-SAT Is at Least 3.52","author":"hajiaghayi","year":"2003","journal-title":"Mathematics"},{"key":"ref17","first-page":"161","article-title":"Algorithms for Computing Backbones of Propositional Formulae","author":"janota","year":"2012","journal-title":"AI communications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_51"},{"key":"ref19","first-page":"264","article-title":"Bounds on Thresholdof Regular Random k-SAT","author":"rathi","year":"2010","journal-title":"International Conference on Theory and Applications of Satisfiability Testing Springer-Verlag"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2014.2335852"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"ref3","article-title":"Effective Uyghur Language Text Detection in Complex Background Images for Traffic Prompt Identification","author":"yan","year":"2017","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2013.04.012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2310494"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_20"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2014.2305909"},{"key":"ref9","first-page":"445","article-title":"Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks","author":"damg\u00e5rd","year":"1991","journal-title":"Advances in Cryptology-CRYPTO'91"},{"key":"ref1","article-title":"Supervised Hash Coding with Deep Neural Network for Environment Perception of Intelligent Vehicles","author":"yan","year":"2017","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"ref20","first-page":"2985","article-title":"Satisfiability Threshold of the Regular Random (k, r)-SAT Problem","author":"zhou","year":"2016","journal-title":"Journal of Software"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20090"},{"key":"ref21","first-page":"477","article-title":"Upper bound on the satisfiablity threshold of regular random (k, s)-SAT problem","author":"zhou","year":"2016","journal-title":"International Journal of Innovative Computing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055717"},{"key":"ref23","article-title":"KEM\/DEM: Necessary and sufficient conditions for secure hybrid encryption","author":"herranz","year":"2006","journal-title":"IACR ePrint Archive"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_4"},{"key":"ref25","article-title":"A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack","author":"sahai","year":"2002","journal-title":"IACR Cryptology ePrint Archive"}],"event":{"name":"2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","start":{"date-parts":[[2017,11,14]]},"location":"Montreal, QC","end":{"date-parts":[[2017,11,16]]}},"container-title":["2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8303183\/8308583\/08309184.pdf?arnumber=8309184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T17:39:58Z","timestamp":1523468398000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8309184\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2017.8309184","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]}}}