Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel

The 2-receiver broadcast channel with primary and third-party receivers is studied. The messages are classified into public, private and confidential. The messages in the public class are messages intended for both receivers. The private messages are intended for the primary receiver with no secrecy requirements imposed upon them. And the confidential messages are aimed exclusively to the primary receiver such that they must not be accessible to the other receiver. The encoder performs the necessary encryption by virtue of local randomness whose rate is assumed to be limited. We find an achievability region on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel.

[1]  Rahul Jain,et al.  One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information , 2018, IEEE Transactions on Information Theory.

[2]  A. Winter,et al.  Quantum privacy and quantum wiretap channels , 2004 .

[3]  Shun Watanabe,et al.  The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages , 2015, IEEE Transactions on Information Theory.

[4]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[5]  M. Tomamichel.  A framework for non-asymptotic quantum information theory , 2012, 1203.2142.

[6]  Rudolf Ahlswede,et al.  Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.

[7]  Mark M. Wilde,et al.  Position-based coding and convex splitting for private communication over quantum channels , 2017, Quantum Information Processing.

[8]  Rahul Jain,et al.  Quantum Communication Using Coherent Rejection Sampling. , 2017, Physical review letters.

[9]  R. Renner,et al.  The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory , 2009, 0912.3805.

[10]  By Ke Li.  SECOND-ORDER ASYMPTOTICS FOR QUANTUM HYPOTHESIS TESTING , 2018 .

[11]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[12]  Sergio Verdú,et al.  Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.

[13]  Renato Renner,et al.  The Single-Serving Channel Capacity , 2006, 2006 IEEE International Symposium on Information Theory.

[14]  Pranab Sen,et al.  Inner bounds via simultaneous decoding in quantum network information theory , 2018, ArXiv.

[15]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[16]  Renato Renner,et al.  Smooth Max-Information as One-Shot Generalization for Mutual Information , 2013, IEEE Transactions on Information Theory.

[17]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[18]  Joseph M. Renes,et al.  Noisy Channel Coding via Privacy Amplification and Information Reconciliation , 2010, IEEE Transactions on Information Theory.

[19]  Marco Tomamichel,et al.  Quantum Information Processing with Finite Resources - Mathematical Foundations , 2015, ArXiv.

[20]  Nilanjana Datta,et al.  The Quantum Capacity of Channels With Arbitrarily Correlated Noise , 2009, IEEE Transactions on Information Theory.

[21]  Igor Devetak,et al.  Quantum Broadcast Channels , 2006, IEEE Transactions on Information Theory.

[22]  Nilanjana Datta,et al.  Generalized relative entropies and the capacity of classical-quantum channels , 2008, 0810.3478.

[23]  Rahul Jain,et al.  One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach , 2017, ArXiv.

[24]  Rahul Jain,et al.  One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[25]  Jaikumar Radhakrishnan,et al.  One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma , 2017, 1703.01932.

[26]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

[27]  Adam D. Smith,et al.  Leftover Hashing Against Quantum Side Information , 2011, IEEE Transactions on Information Theory.

[28]  Jörg Kliewer,et al.  On secure communication with constrained randomization , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[29]  Mark M. Wilde,et al.  Applications of position-based coding to classical communication over quantum channels , 2017, 2017 IEEE Information Theory Workshop (ITW).

[30]  Nilanjana Datta,et al.  Min- and Max-Relative Entropies and a New Entanglement Monotone , 2008, IEEE Transactions on Information Theory.

[31]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[32]  Igor Devetak.  The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

[33]  P. Shor,et al.  The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information , 2003, quant-ph/0311131.

[34]  R. Renner,et al.  Generalized Entropies , 2012, 1211.3141.

[35]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[36]  R. Renner,et al.  One-shot classical-quantum capacity and hypothesis testing. , 2010, Physical review letters.

[37]  Mark M. Wilde,et al.  Quantum Information Theory , 2013 .

[38]  Masahito Hayashi,et al.  Secure Communication Over Fully Quantum Gel' Fand-Pinsker Wiretap Channel , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[39]  Abbas El Gamal,et al.  Three-Receiver Broadcast Channels With Common and Confidential Messages , 2012, IEEE Transactions on Information Theory.

[40]  Masahito Hayashi,et al.  A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks , 2012, IEEE Transactions on Information Theory.