A secret sharing scheme on p^2 -dimensional quantum system

Na Hao, Zhihui Li, Haiyan Bai, Chen‐Ming BaiarXiv 2018 · DOI · arXiv

This paper, published in early 2018, presents a theoretical framework for a quantum secret sharing (QSS) scheme that operates in higher-dimensional Hilbert spaces—specifically $p^2$-dimensional systems. By moving beyond simple qubits, the authors propose a more scalable and secure way to distribute secrets among $N$ participants.

TL;DR

The authors develop a new $(N, N)$ threshold quantum secret sharing scheme using a single high-dimensional particle (a qudit) in a $p^2$-dimensional system. By leveraging the unique properties of Mutually Unbiased Bases (MUBs) and finite field theory, they create a protocol that is more scalable than multi-particle entangled schemes and resilient against common cryptographic attacks.

What Problem Does This Paper Address?

In classical cryptography, secret sharing involves dividing a secret into "shares" such that only a specific authorized group (a threshold) can reconstruct the original message. Quantum secret sharing (QSS) does the same but uses the laws of physics to ensure that any attempt to eavesdrop or cheat is physically detectable.

Most existing QSS protocols rely on qubits (2-dimensional systems) or complex entangled states like GHZ states. These are difficult to scale because maintaining entanglement between many particles over long distances is experimentally challenging. Furthermore, previous qudit-based schemes were often limited to $p$-dimensional systems (where $p$ is a prime). This paper addresses the gap by extending these protocols to $p^2$ dimensions, which offers higher information density and potentially better security.

Methods

The researchers utilize several advanced mathematical and quantum mechanical tools:

  • Mutually Unbiased Bases (MUBs): These are sets of bases where, if a system is prepared in a state of one basis, measuring it in another basis yields a completely random result. The authors define these bases specifically for $d = p^2$ dimensions using the theory of finite fields ($F_{p^2}$).
  • Unitary Transformations: They construct a specific unitary matrix $U_{\alpha, \beta}$ that can map any vector in a given MUB to another vector in a related MUB. This transformation acts as the "encoding" mechanism for the secret shares.
  • Single-Particle Protocol: Unlike schemes that require $N$ entangled particles for $N$ people, this protocol uses just one qudit. Alice (the distributor) prepares the qudit and sends it to the first participant. Each participant applies their own unitary transformation (their "share") and passes it to the next, eventually returning it to Alice for measurement.

Datasets

Not discussed in the paper. As a theoretical work in quantum information theory, the paper relies on mathematical proofs and symbolic examples rather than empirical datasets.

Key Insights and Ideas

  • The Power of $p^2$: Moving from $p$ to $p^2$ dimensions isn't just about adding more states; it involves using the quadratic extension of finite fields. This allows for a more complex and robust set of MUBs, which the authors prove can be cycled through using their constructed unitary operators.
  • Cyclicity as a Security Feature: The authors demonstrate that the subscripts and superscripts of their MUBs follow a cyclic property. This allows the secret to be "summed" across participants in a way that Alice can verify at the end of the chain.
  • Scalability via Single Particles: By using a single qudit passed in a "round-robin" fashion, the hardware requirements for the participants are simplified. They only need to be able to apply a local unitary transformation rather than generate or maintain complex multi-party entanglement.

Key Results

  • Protocol Construction: The authors successfully designed a complete $(N, N)$ threshold scheme where all $N$ participants must cooperate to recover the secret.
  • Security Proofs: The paper provides a detailed analysis of several attack vectors:
  • Intercept-and-Resend: Because the system is $p^2$-dimensional, an eavesdropper has a very low probability ($1/p^2$) of choosing the correct basis, making their interference highly detectable.
  • Entangle-and-Measure: The authors prove that an attacker cannot entangle an ancillary particle to the qudit to gain information without disturbing the state and being caught during Alice's testing phase.
  • Trojan Horse Attacks: The scheme is shown to be resilient against multi-photon and invisible photon attacks using standard Photon Number Splitting (PNS) technology and filters.
  • Concrete Example: The paper includes a step-by-step walkthrough of the protocol for a 9-dimensional system ($p=3$), demonstrating how the math translates into a functional cryptographic process.

Limitations and Future Work

  • Generalization: While the paper successfully moves from $p$ to $p^2$, the authors note that generalizing this to any power of a prime ($p^n$) is the next logical step but involves significantly more complex mathematics.
  • Experimental Realization: The paper is purely theoretical. Implementing this requires high-fidelity control over 9-dimensional (or higher) quantum systems, which is more difficult than controlling standard qubits.
  • Complex Attack Scenarios: The authors admit that while they covered standard attacks, "rigorous security proof for general conspiracies" (more complex internal collusions) remains an open question for future study.

Summary updated

Abstract

In this paper, we give the mutually unbiased bases on the p^2 -dimensional quantum system where p is an odd prime number, and construct the corresponding unitary transformation based on the properties of these mutually unbiased bases. Then, we construct a (N,N) threshold secret sharing scheme using unitary transformation between these mutually unbiased bases, and analyze the scheme's security by several ways, for example, intercept-and-resend attack, entangle-and-measure attack, Trojan horse attack, and so on. Using our method, we construct a single-particle quantum protocol involving only one qudit, and the method shows much more scalability than other schemes.
BibTeX
@misc{hao2018secret,
  author = {Na Hao and Zhihui Li and Haiyan Bai and Chen‐Ming Bai},
  title = {{A secret sharing scheme on p^2 -dimensional quantum system}},
  year = {2018},
  eprint = {1801.05939},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1801.05939},
}
Figure