Practical device-independent quantum cryptography via entropy accumulation, Nature Communications, vol.9, p.459, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01992050
Simple and tight device-independent security proofs, 2016. ,
Decoding quantum information via the Petz recovery map, Journal of Mathematical Physics, vol.57, p.82203, 2016. ,
Quantum achievability proof via collision relative entropy, IEEE Transactions on Information Theory, vol.60, pp.7980-7986, 2014. ,
Quantum and relativistic protocols for secure multi-party computation, 2006. ,
Private Randomness Expansion With Untrusted Devices, J. Phys. A-Math. Gen, vol.44, p.95305, 2011. ,
Robust randomness amplifiers: Upper and lower bounds, Proc. APPROX-RANDOM ,
Second-order asymptotics for source coding, dense coding, and pure-state entanglement conversions, IEEE Transactions on Information Theory, vol.61, issue.1, pp.582-608, 2015. ,
Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d.-quantum lattice systems and more, Journal of Mathematical Physics, vol.57, p.62207, 2016. ,
Trevisan's extractor in the presence of quantum side information, In: SIAM J. Comput, vol.41, pp.915-940, 2012. ,
Entropy accumulation, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01925985
Information spectrum approach to second-order coding rate in channel coding, IEEE Transactions on Information Theory, vol.55, pp.4947-4966, 2009. ,
Relative entropies and their use in quantum information theory, 2016. ,
Second-order asymptotics for quantum hypothesis testing, Annals of Statistics, vol.42, pp.171-189, 2014. ,
Universal security for randomness expansion, 2014. ,
On quantum Rényi entropies: a new generalization and some properties, Journal of Mathematical Physics, vol.54, p.122203, 2013. ,
The Chernoff lower bound for symmetric quantum hypothesis testing, Annals of Statistics, vol.37, pp.1040-1057, 2009. ,
Quasi-entropies for finite quantum systems, In: Reports on Mathematical Physics, vol.23, issue.86, pp.90067-90071, 1986. ,
Random numbers certified by Bell's theorem, Nature, vol.464, pp.1021-1024, 2010. ,
Device-independent quantum key distribution secure against collective attacks, New Journal of Physics, vol.11, p.45021, 2009. ,
Channel coding: non-asymptotic fundamental limits, 2010. ,
Channel Coding Rate in the Finite Blocklength Regime, Information Theory, vol.56, pp.2307-2359, 2010. ,
DOI : 10.1109/tit.2010.2043769
URL : http://www.princeton.edu/~verdu/reprints/PolPooVerMay2010.pdf
Asymptotische Abschätzungen in Shannons Informationstheorie, Trans. 3rd Prague Conf. Inf. Theory, pp.689-723, 1962. ,
A Framework for Non-Asymptotic Quantum Information Theory, 2012. ,
A fully quantum asymptotic equipartition property, IEEE Trans. Inform. Theory, vol.55, pp.5840-5847, 2009. ,
DOI : 10.1109/tit.2009.2032797
URL : http://arxiv.org/pdf/0811.1221
, Quantum Information Processing with Finite Resources: Mathematical Foundations, vol.5, 2015.
DOI : 10.1007/978-3-319-21891-5
URL : http://arxiv.org/pdf/1504.00233
Duality between smooth min-and max-entropies, IEEE Trans. Inform. Theory, vol.56, p.4674, 2010. ,
DOI : 10.1109/tit.2010.2054130
URL : http://arxiv.org/pdf/0907.5238
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks, IEEE Transactions on Information Theory, vol.59, pp.7693-7710, 2013. ,
Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels, Communications in Mathematical Physics, vol.338, pp.103-137, 2015. ,
Second-Order Coding Rates for Channels With State, Information Theory, IEEE Transactions on 60, vol.8, pp.4427-4448, 2014. ,
DOI : 10.1109/tit.2014.2324555
URL : http://arxiv.org/pdf/1305.6789
Certifiable quantum dice: or, true random number generation secure against quantum adversaries, Proc. ACM STOC, pp.61-76, 2012. ,
Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy, Communications in Mathematical Physics, vol.331, pp.593-622, 2014. ,