2012
Encryption with weakly random keys using quantum ciphertext
BOUDA, Jan, Matej PIVOLUSKA a Martin PLESCHZákladní údaje
Originální název
Encryption with weakly random keys using quantum ciphertext
Autoři
BOUDA, Jan (203 Česká republika, garant, domácí), Matej PIVOLUSKA (703 Slovensko, domácí) a Martin PLESCH (703 Slovensko, domácí)
Vydání
Quantum Information and Computing, Princeton, USA, Rinton, 2012, 1533-7146
Další údaje
Jazyk
angličtina
Typ výsledku
Článek v odborném periodiku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Spojené státy
Utajení
není předmětem státního či obchodního tajemství
Impakt faktor
Impact factor: 1.646
Kód RIV
RIV/00216224:14330/12:00057319
Organizační jednotka
Fakulta informatiky
UT WoS
000304380700002
Klíčová slova anglicky
quantum cryptography weak randomness encryption
Štítky
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 23. 4. 2013 15:46, RNDr. Pavel Šmerk, Ph.D.
Anotace
V originále
The lack of perfect randomness can cause significant problems in securing communication between two parties. McInnes and Pinkas proved that unconditionally secure encryption is impossible when the key is sampled from a weak random source. The adversary can always gain some information about the plaintext, regardless of the cryptosystem design. Most notably, the adversary can obtain full information about the plaintext if he has access to just two bits of information about the source (irrespective on length of the key). In this paper we show that for every weak random source there is a cryptosystem with a classical plaintext, a classical key, and a quantum ciphertext that bounds the adversary's probability $p$ to guess correctly the plaintext strictly under the McInnes-Pinkas bound, except for a single case, where it coincides with the bound. In addition, regardless of the source of randomness, the adversary's probability $p$ is strictly smaller than $1$ as long as there is some uncertainty in the key (Shannon/min-entropy is non-zero). These results are another demonstration that quantum information processing can solve cryptographic tasks with strictly higher security than classical information processing.
Návaznosti
GAP202/12/1142, projekt VaV |
| ||
GBP202/12/G061, projekt VaV |
| ||
MUNI/A/0914/2009, interní kód MU |
|