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

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

2009-03-27

arxiv.org/abs/0903.4744v1

Phys. Rev. A 79, 042327 (2009)

Physics

Quantum Physics

5 pages, 1 figure

Scientific paper

10.1103/PhysRevA.79.042327

In 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.

Affiliated with

Also associated with

No associations

Rating

Deterministic quantum-public-key encryption: forward search attack and randomization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic quantum-public-key encryption: forward search attack and randomization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic quantum-public-key encryption: forward search attack and randomization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21268