Quick Navigation

Topics

Quantum Cryptography Security

Quantum entropic security and approximate quantum encryption

arXiv
Authors: Simon Pierre Desrosiers, Frédéric Dupuis

Year

2007

Paper ID

49751

Status

Preprint

Abstract Read

~2 min

Abstract Words

97

Citations

N/A

Abstract

We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is made. This limit is quantified using the quantum conditional min-entropy as introduced by Renato Renner. A proof of the equivalence between the two security definitions is presented. We also provide proofs of security for two different cyphers in this model and a proof for a lower bound on the key length required by any such cypher. These cyphers generalise existing schemes for approximate quantum encryption to the entropic security model.

Why This Paper Matters

  • This paper contributes to the Quantum Cryptography & Security research area in the Quantum Articles archive.
  • It adds a 2007 reference point for readers tracking recent quantum research.
  • We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #49751

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.