We consider using a secret key and a noisy quantum channel to generate noiseless public communication and noiseless private communication. The optimal protocol for this setting is the publicly enhanced private father protocol. This protocol exploits random coding techniques and ``piggybacking'' of public information along with secret-key-assisted private codes. The publicly enhanced private father protocol is a generalization of the secret-key-assisted protocol of Hsieh, Luo, and Brun and a generalization of a protocol for simultaneous communication of public and private information suggested by Devetak and Shor.We consider using a secret key and a noisy quantum channel to generate noiseless public communication and noiseless private communication. The optimal protocol for this setting is the publicly enhanced private father protocol. This protocol exploits random coding techniques and ``piggybacking'' of public information along with secret-key-assisted private codes. The publicly enhanced private father protocol is a generalization of the secret-key-assisted protocol of Hsieh, Luo, and Brun and a generalization of a protocol for simultaneous communication of public and private information suggested by Devetak and Shor.

arXiv:0903.3920Physical Review AAug 5, 200920 citations

Practical private randomness generation

Stefano Pironio, Serge Massar

Nov 25, 20110 citations

Randomness complexity of private computation

Carlo Blundo, Alfredo De Santis, Giuseppe Persiano +1 more

Computational ComplexityNov 1, 199927 citations

No-signaling-proof randomness extraction from public weak sources

Ravishankar Ramanathan, Michał Banacki, Paweł Horodecki

The extraction of randomness from weakly random seeds is a topic of central importance in cryptography. Weak sources of randomness can be considered to be either private or public, where public sources such as the NIST randomness beacon broadcast the random bits once they are generated. The problem of device-independent randomness extraction from weak public sources against no-signalling adversaries has remained open. In this paper, we show protocols for device-independent and one-sided device-independent amplification of randomness from weak public Santha Vazirani (SV) sources that use a finite number of devices and are secure against no-signaling adversaries. Specifically, under the assumption that the device behavior is as prescribed by quantum mechanics the protocols allow for amplification of public $ε$ -SV sources for arbitrary initial $ε\in [0,0.5)$ . On the other hand, when only the assumption of no-signaling between the components of the device is made, the protocols allow for amplification of a limited set of weak public SV sources.The extraction of randomness from weakly random seeds is a topic of central importance in cryptography. Weak sources of randomness can be considered to be either private or public, where public sources such as the NIST randomness beacon broadcast the random bits once they are generated. The problem of device-independent randomness extraction from weak public sources against no-signalling adversaries has remained open. In this paper, we show protocols for device-independent and one-sided device-independent amplification of randomness from weak public Santha Vazirani (SV) sources that use a finite number of devices and are secure against no-signaling adversaries. Specifically, under the assumption that the device behavior is as prescribed by quantum mechanics the protocols allow for amplification of public $ε$-SV sources for arbitrary initial $ε\in [0,0.5)$. On the other hand, when only the assumption of no-signaling between the components of the device is made, the protocols allow for amplification of a limited set of weak public SV sources.

arXiv:2108.08819Aug 19, 20213 citations

Random Sources in Private Computation

Geoffroy Couteau, Adi Rosén

Lecture notes in computer scienceJan 1, 20221 citation

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

Farzin Salek, Min-Hsiu Hsieh, J.R. Fonollosa

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

arXiv:1903.04463IEEE International Symposium on Information Theory (ISIT)Jul 1, 201913 citations

ε

-SV sources for arbitrary initial

ε\in [0,0.5)

. On the other hand, when only the assumption of no-signaling between the components of the device is made, the protocols allow for amplification of a limited set of weak public SV sources.