完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLa, Ching-Yien_US
dc.contributor.authorChung, Kai-Minen_US
dc.date.accessioned2019-10-05T00:08:45Z-
dc.date.available2019-10-05T00:08:45Z-
dc.date.issued2019-09-01en_US
dc.identifier.issn0925-1022en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10623-018-00597-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/152846-
dc.description.abstractThe famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect correctness. We also give a systematic study of information-theoretically secure quantum encryption with two secrecy definitions. We show that the weaker one implies the stronger but with a security loss in d, where d is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of o(d(-1)).en_US
dc.language.isoen_USen_US
dc.subjectShannon impossibilityen_US
dc.subjectInformation-theoretic securityen_US
dc.subjectKey lengthen_US
dc.subjectQuantum one-time paden_US
dc.titleQuantum encryption and generalized Shannon impossibilityen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10623-018-00597-3en_US
dc.identifier.journalDESIGNS CODES AND CRYPTOGRAPHYen_US
dc.citation.volume87en_US
dc.citation.issue9en_US
dc.citation.spage1961en_US
dc.citation.epage1972en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000483581300002en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文