Raja - All graph state verification protocols are composably secure

All graph state verification protocols are composably secure

This seminar, given by Raja, will happend on 21 June 2024, at 9:0. It will take place in Room Not specified.

Find a map of the campus here.

Abstract

Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. In this talk I will present the results from our last article (with LIP6 people !) in which we prove that all graph state verification protocols can be turned into a protocol realizing the ideal functionality of graph-state sharing. We also show that any unchanged protocol realizes a slightly different, yet useful, graph state sharing functionality that allows the malicious agents to perform a restricted set of deviation on the state. Our proof is done in the Abstract Cryptography framework, and we use scalable ZX-Calculus for the mathematics . Along the way, we show a protocol to generalize entanglement swapping to arbitrary graph states, which might be of independent interest. https://arxiv.org/pdf/2402.01445.pdf