Quantum secret aggregation utilizing a network of agents
Michael Ampatzis, Theodore Andronikos

TL;DR
This paper introduces a quantum protocol for secure aggregation of partial secrets from distributed agents using GHZ entanglement, ensuring confidentiality and security against eavesdroppers.
Contribution
It presents a novel quantum secret aggregation protocol employing GHZ states, enabling secure and complete transmission of partial secrets in a network.
Findings
Protocol guarantees secure secret transmission using entanglement.
Entanglement makes eavesdropping statistically improbable.
Protocol works in complete generality for distributed agents.
Abstract
In this work we consider the following problem: given a network of spies, all distributed in different locations in space, and assuming that each spy possesses a small, but incomplete by itself part of a big secret, is it possible to securely transmit all these partial secrets to the spymaster, so that they can be combined together in order to reveal the big secret? We refer to it as the Quantum Secret Aggregation problem, and we propose a protocol, in the form of a quantum game, with Alice taking over the role of the spymaster, that addresses this problem in complete generality. Our protocol relies on the use of maximally entangled GHZ tuples, which are symmetrically distributed among Alice and all her spies. It is the power of entanglement that makes possible the secure transmission of the small partial secrets from the agents to the spymaster. As an additional bonus, entanglement…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Benford’s Law and Fraud Detection
