#### Filter Results:

#### Publication Year

2008

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The Rényi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or mutual information, and have found many applications in information theory and beyond. Various generalizations of Rényi… (More)

- Stefan Wolf, Prof, Ivan Damgård, Don Beaver, Hugue Blier, Gilles Brassard +49 others

2007 ii Acknowledgments First of all, I would like to thank Stefan Wolf who has been a great advisor. Many results in this thesis are the outcome of endless discussions with him. I also want to thank Ivan Damgård for co-refereeing this thesis. I would also like to thank all the people I was able to work with or talk to about my research during the last few… (More)

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties , can be privately implemented against a quantum version of classical semi-honest adversaries that we call specious. Our construction requires two ideal functionalities to garantee privacy: a private SWAP between registers… (More)

— A new protocol for quantum broadcast channels based on the fully quantum Slepian-Wolf protocol is presented. The protocol yields an achievable rate region for entanglement-assisted transmission of quantum information through a quantum broadcast channel that can be considered the quantum analogue of Marton's region for classical broadcast channels. The… (More)

We provide the first two-party protocol allowing Alice and Bob to evaluate privately even against active adversaries any completely positive, trace-preserving map F ∈ L(Ain ⊗ Bin) → L(Aout ⊗ Bout), given as a quantum circuit, upon their joint quantum input state ρin ∈ D(Ain ⊗ Bin). Our protocol leaks no more to any active adversary than an ideal… (More)

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.… (More)

- Frédéric Dupuis, Wei Yu, Frans M J Willems

— This paper presents numerical algorithms for the computation of the capacity for channels with non-causal transmitter side information (the Gel'fand-Pinsker problem) and the rate-distortion function for source coding with decoder side information (the Wyner-Ziv problem). The algorithms are based on the reformulation of the mutual information expressions… (More)

Polar coding, introduced 2008 by Arıkan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information.… (More)

- Xiongfeng Ma, Jean-Christian Boileau, Ryan Bolen, Kai Chen, Marcos Curty, Frédéric Dupuis +10 others
- 2008

Quantum cryptography: from theory to practice 2008 Quantum cryptography or quantum key distribution (QKD) applies fundamental laws of quantum physics to guarantee secure communication. The security of quantum cryptography was proven in the last decade. Many security analyses are based on the assumption that QKD system components are idealized. In practice,… (More)