{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:44:07Z","timestamp":1729651447531,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.23919\/fruct.2017.8071324","type":"proceedings-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T19:29:28Z","timestamp":1508959768000},"page":"284-289","source":"Crossref","is-referenced-by-count":1,"title":["Deniable encryption protocols based on probabilistic public-key encryption"],"prefix":"10.23919","author":[{"given":"Nikolay","family":"Moldovyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Berezin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatoly","family":"Kornienko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Moldovyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"159","article-title":"Receiver-deniable public-key encryption","volume":"2","author":"ibrahim","year":"2009","journal-title":"International Journal of Security and Networks"},{"key":"ref11","first-page":"277","article-title":"Practical Method for Bi-Deniable Public-Key Encryption","volume":"22","author":"moldovyan","year":"2014","journal-title":"Quasigroups Relat Systems"},{"key":"ref12","first-page":"3231","article-title":"A New Sender-Side Public-Key Deniable Encryption Scheme with Fast Decryption","volume":"8","author":"barakat","year":"2014","journal-title":"KSII T Internet Inf"},{"key":"ref13","first-page":"1","article-title":"A method for obtaining deniable public-key encryption","volume":"1","author":"ibrahim","year":"2009","journal-title":"International Journal of Security and Networks"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref16","first-page":"216","article-title":"Strong primes are easy to find","author":"gordon","year":"1984","journal-title":"Advances in Cryptology Proc Of EUROCRYPT"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_33"},{"key":"ref18","first-page":"727","article-title":"On the impossibility of sender-deniable public key encryption","author":"dachman-soled","year":"2012","journal-title":"IACR Cryptology ePrint"},{"key":"ref19","first-page":"390","article-title":"An approach to shorten digital signature length","volume":"14","author":"moldovyan","year":"2006","journal-title":"Computer Science Journal of Moldova"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4304\/jnw.4.5.370-377"},{"key":"ref3","first-page":"60","article-title":"Generating Cubic Equations as a Method for Public Encryption","volume":"79","author":"moldovyan","year":"2015","journal-title":"BULETINUL ACADEMIEI DE STIINTE A REPUBLICII MOLDOVA MATEMATICA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.4304\/jnw.5.6.683-690"},{"key":"ref8","first-page":"254","article-title":"A receiver deniable encryption scheme","author":"meng","year":"2009","journal-title":"Int Symp on Inf Proc (ISIP09)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_30"},{"key":"ref2","first-page":"68","article-title":"Stream Deiable-Encryption Algorithm Satisfying Criterion of the Computational Indistinguishability from Probabilistic Ciphering","volume":"24","author":"moldovyan","year":"2016","journal-title":"Computer Science Journal of Moldova"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052229"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77566-9_52"},{"key":"ref20","first-page":"27","article-title":"Short signatures from difficulty of the factoring problem","author":"moldovyan","year":"2013","journal-title":"BULETINUL ACADEMIEI DE STIINTE A REPUBLICII MOLDOVA MATEMATICA"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/978-3-642-20465-4_33","article-title":"Deniable encryption with negligible detection probability: An interactive construction","volume":"6632","author":"markus","year":"2011","journal-title":"Advances in Cryptology - EUROCRYPT 2011"},{"key":"ref21","first-page":"454","article-title":"How to use indistinguishability obfuscation: Deniable encryption and more","author":"sahai","year":"2013","journal-title":"IACR Cryptology ePrint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FRUCT-ISPIT.2016.7561530"}],"event":{"name":"2017 20th Conference of Open Innovations Association (FRUCT)","start":{"date-parts":[[2017,4,3]]},"location":"St-Petersburg, Russia","end":{"date-parts":[[2017,4,7]]}},"container-title":["2017 20th Conference of Open Innovations Association (FRUCT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8053875\/8071282\/08071324.pdf?arnumber=8071324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T04:41:30Z","timestamp":1570250490000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8071324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":23,"URL":"https:\/\/doi.org\/10.23919\/fruct.2017.8071324","relation":{},"subject":[],"published":{"date-parts":[[2017,4]]}}}