NDLI: Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity

Please wait, while we are loading the content...

Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity

Content Provider	Springer Nature Link
Author	Winter, Andreas
Copyright Year	2015
Abstract	We show that it is possible for the so-called weak locking capacity of a quantum channel (Guha et al. in Phys Rev X 4:011016, 2014) to be much larger than its private capacity. Both reflect different ways of capturing the notion of reliable communication via a quantum system while leaking almost no information to an eavesdropper; the difference is that the latter imposes an intrinsically quantum security criterion whereas the former requires only a weaker, classical condition. The channels for which this separation is most straightforward to establish are the complementary channels of classical-quantum (cq-)channels and, hence, a subclass of Hadamard channels. We also prove that certain symmetric channels (related to photon number splitting) have positive weak locking capacity in the presence of a vanishingly small pre-shared secret, whereas their private capacity is zero. These findings are powerful illustrations of the difference between two apparently natural notions of privacy in quantum systems, relevant also to quantum key distribution: the older, naïve one based on accessible information, contrasting with the new, composable one embracing the quantum nature of the eavesdropper’s information. Assuming an additivity conjecture for constrained minimum output Rényi entropies, the techniques of the first part demonstrate a single-letter formula for the weak locking capacity of complements to cq-channels, coinciding with a general upper bound of Guha et al. for these channels. Furthermore, still assuming this additivity conjecture, this upper bound is given an operational interpretation for general channels as the maximum weak locking capacity of the channel activated by a suitable noiseless channel.
Starting Page	1
Ending Page	21
Page Count	21
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	30
Issue Number	1
e-ISSN	14321378
Language	English
Publisher	Springer US
Publisher Date	2015-09-14
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Quantum channel Private capacity Quantum key distribution Accessible information Composability Locking capacity Coding and Information Theory Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Weak locking capacity of quantum channels can be much larger than private capacity

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

GNUC: A New Universal Composability Framework

Practical Aspects of Quantum Cryptographic Key Distribution

Polynomial Runtime and Composability

A Proof of the Security of Quantum Key Distribution

Long-Term Security and Universal Composability

General Composition and Universal Composability in Secure Multiparty Computation

Quantum Private Information Retrieval has Linear Communication Complexity

Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity

Similar Documents

Weak locking capacity of quantum channels can be much larger than private capacity

Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs

GNUC: A New Universal Composability Framework

Practical Aspects of Quantum Cryptographic Key Distribution

Polynomial Runtime and Composability

A Proof of the Security of Quantum Key Distribution

Long-Term Security and Universal Composability

General Composition and Universal Composability in Secure Multiparty Computation

Quantum Private Information Retrieval has Linear Communication Complexity

Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity