{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:26:24Z","timestamp":1648697184759},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p> Using one-time pads is the only cryptographic solution that really ensures the secrecy of a transmitted message. The communicating parties have to meet in advance to establish the value of any one-time pad. This means that the two parties have to meet regularly to renew the batch of one-time pads they share. By contrast, we show that after developing a secret reading mask using any quantum key distribution algorithm, the two parties can communicate indefinitely by encrypting each of their messages with a one-time pad. The value of the one-time pad is quantum encrypted and transmitted prior to the transmission of the message itself. <\/jats:p>","DOI":"10.1142\/s0129626410000211","type":"journal-article","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T09:27:48Z","timestamp":1285061268000},"page":"263-273","source":"Crossref","is-referenced-by-count":2,"title":["ONE-TIME PADS WITHOUT PRIOR ENCOUNTER"],"prefix":"10.1142","volume":"20","author":[{"given":"NAYA","family":"NAGY","sequence":"first","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario, Canada K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SELIM G.","family":"AKL","sequence":"additional","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario, Canada K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf2","volume-title":"Cryptography and Data Security","author":"Denning D. E. R.","year":"1982"},{"key":"rf3","volume-title":"Cryptography","author":"Meyer C. H.","year":"1982"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407003058"},{"key":"rf6","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen M. A.","year":"2000"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1038\/299802a0"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626410000211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:45:46Z","timestamp":1565117146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626410000211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S0129626410000211"],"URL":"https:\/\/doi.org\/10.1142\/s0129626410000211","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}