REVIEW 3 cited by
Security in Quantum Cryptography
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Quantum cryptography exploits principles of quantum physics for the secure processing of information. A prominent example is secure communication, i.e., the task of transmitting confidential messages from one location to another. The cryptographic requirement here is that the transmitted messages remain inaccessible to anyone other than the designated recipients, even if the communication channel is untrusted. In classical cryptography, this can usually only be guaranteed under computational hardness assumptions, e.g., that factoring large integers is infeasible. In contrast, the security of quantum cryptography relies entirely on the laws of quantum mechanics. Here we review this physical notion of security, focusing on quantum key distribution and secure communication.
Forward citations
Cited by 3 Pith papers
-
On estimating operator norm distance, with optimal trace distance estimation when one state is pure
Rank-independent quantum estimators achieve Θ(1/ε) queries for operator-norm (and trace) distance when one state is pure, and Õ(1/ε^{3/2}) queries for general states, proving BQP-completeness.
-
Realizing Unitary $k$-designs with a Single Quench
A single quench between two independent random Hamiltonians at the Thouless time generates unitary k-designs.
-
Analytic R\'enyi Entropy Bounds for Device-Independent Cryptography
Exact analytic Rényi entropy rate functions for the CHSH inequality tighten finite-size DIQKD key rates and reduce the minimum number of rounds by nearly a factor of three.
Discussion (0). Continue with ORCID to comment.