Byzantine Server and Static Eavesdropper Coalition in a Quantum XTUSPIR System

We consider the problem of quantum symmetric private information retrieval (QSPIR) in the presence of Byzantine servers and static eavesdroppers along with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$X$</tex>-security and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$T$</tex>-colluding privacy parameters. The Byzantine servers in our model can send any symbol that can be any function of their storage, queries received, shared randomness among servers, and an independent random variable, as in [1]. This is the first paper to consider the presence of Byzantine servers, eavesdroppers, and unresponsive servers together in a QPIR system with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$X$</tex>-security and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$T$</tex>-colluding parameters. In addition, ours is also the first work to consider symmetric privacy requirements in the presence of Byzantine servers in classical or quantum PIR settings.