Team : QI
- Sorbonne Université - LIP6
Boîte courrier 169
Couloir 25-26, Étage 1, Bureau 104
4 place Jussieu
75252 PARIS CEDEX 05
Tel: +33 1 44 27 44 88, Luka.Music (at) nulllip6.fr
Supervision : Elham KASHEFI
Co-supervision : Céline CHEVALIER
Multi-Party Quantum Cryptography: From Folklore to Real-World
Quantum cryptography builds upon decades of advances both in classical cryptography and networks. However, contrary to its classical counterparts, it is still in its infancy applicability-wise, even in the scenario where powerful quantum computers are readily available, and more theoretical work is required before it can provide concrete benefits.
The first goal is to formalise in rigorous quantum security frameworks the properties of various techniques that have been transposed, often without proper justification, from the classical world.
Then, the recent developments in quantum technologies suggest a mostly cloud-based future availability of quantum devices. Therefore, quantum computation and communication cost of protocol participants must be lowered before being useful.
Finally, in most situations, additional steps need to be taken to tailor protocols to the specifications of devices. This allows for optimisations both in terms of quantum memory and operation requirements.
This thesis contributes to these three aspects by:
- giving the first general security definition of the Quantum Cut-and-Choose, a technique for proving the correctness of a quantum message;
- presenting a more realistic framework of security against superposition attacks, where classical protocols run on inherently quantum devices;
- constructing an efficient delegated multi-party quantum computation protocol, allowing clients to delegate securely to a quantum server a private computation;
- building a method for verifying the honesty of a quantum server performing computations on behalf of a client with no operation or memory overhead compared to the unprotected computation.
Defence : 07/09/2021 - 14h - Campus Jussieu, salle Jacques Pitrat (25-26/105)
Jury members :
M. Olivier Blazy, Université de Limoges [Rapporteur]
M. Gorjan Alagic, University of Maryland [Rapporteur]
M. David Pointcheval, ENS Paris
Mme. Aikaterini Mitrokotsa, University of St. Gallen
M. André Chailloux, INRIA
Mme. Anna Pappa, Technical University Berlin
Mme. Elham Kashefi, Sorbonne Université/University of Edinburgh
Mme. Céline Chevalier, Université Panthéon Assas Paris 2
- L. Music : “Multi-Party Quantum Cryptography: From Folklore to Real-World”, thesis, defence 07/09/2021, supervision Kashefi, Elham, rapporteurs : Céline CHEVALIER (2021)
- D. Leichtle, L. Music, E. Kashefi, H. Ollivier : “Verifying BQP Computations on Noisy Devices with Minimal Overhead”, PRX Quantum, vol. 2 (4), pp. 040302, (APS Physics) (2021)
- Th. Kapourniotis, E. Kashefi, L. Music, H. Ollivier : “Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds”, (2021)
- E. Kashefi, L. Music, P. Wallden : “The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation”, (2021)
- L. Music, E. Kashefi, C. Chevalier : “Dispelling Myths on Superposition Attacks: Formal Security Model and Attack Analyses”, International Conference on Provable Security, ProvSec 2020: Provable and Practical Security, vol. 12505, Lecture Notes in Computer Science, Singapour / Virtual, Singapore, pp. 318-337, (Springer) (2020)
- E. Kashefi, D. Leichtle, L. Music, H. Ollivier : “Securing Quantum Computations in the NISQ Era”, (2020)