Deterministic quantum-public-key encryption: forward search attack and randomization

Simple item page
dc.creatorNikolopoulos, Georgios M.
dc.creatorIoannou, Lawrence M.
dc.date2009-03-27
dc.date.accessioned2026-07-07T13:11:12Z
dc.date.available2026-07-07T13:11:12Z
dc.descriptionIn the classical setting, public-key encryption requires randomness in order to be secure against a forward search attack, whereby an adversary compares the encryption of a guess of the secret message with that of the actual secret message. We show that this is also true in the information-theoretic setting -- where the public keys are quantum systems -- by defining and giving an example of a forward search attack for any deterministic quantum-public-key bit-encryption scheme. However, unlike in the classical setting, we show that any such deterministic scheme can be used as a black box to build a randomized bit-encryption scheme that is no longer susceptible to this attack.
dc.description5 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0903.4744
dc.identifierhttp://arxiv.org/abs/0903.4744
dc.identifierPhys. Rev. A 79, 042327 (2009)
dc.identifierdoi:10.1103/PhysRevA.79.042327
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229216
dc.subjectQuantum Physics
dc.titleDeterministic quantum-public-key encryption: forward search attack and randomization
dc.typetext

Files

Collections

arXiv