Quantum secret aggregation utilizing a network of 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 guarantees the security of the protocol, by making it statistically improbable for the notorious eavesdropper Eve to steal the big secret.

References in corpus (27)

• Quantum cryptography: Public key distribution and coin tossing
• Quantum secret sharing
• Bell nonlocality
• Distributed Entanglement
• How to share a quantum secret
• Security Aspects of Practical Quantum Cryptography
• Quantum Games and Quantum Strategies
• Quantum strategies
• Security against individual attacks for realistic quantum key distribution
• On the Theory of Quantum Secret Sharing
• Quantum Cryptography with Coherent States
• Long-Distance Quantum Communication with Entangled Photons using Satellites
• Absolute Maximal Entanglement and Quantum Secret Sharing
• No extension of quantum theory can have improved predictive power
• Long-Distance Measurement-Device-Independent Multiparty Quantum Communication
• Quantum secret sharing with qudit graph states
• Security of differential phase shift quantum key distribution against individual attacks
• Efficient quantum algorithms for $GHZ$ and $W$ states, and implementation on the IBM quantum computer
• Experimental Passive Round-Robin Differential Phase-Shift Quantum Key Distribution
• Quantum secret sharing using weak coherent states
• Secret Sharing for Cloud Data Security
• Secure Quantum Secret Sharing without Signal Disturbance Monitoring
• Reducing the quantum communication cost of quantum secret sharing
• QKD based on symmetric entangled Bernstein-Vazirani
• Conditions that enable a player to surely win in sequential quantum games
• A two-party quantum parliament
• A symmetric extensible protocol for quantum secret sharing

Cited by in corpus (9)

• A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
• A Multiparty Quantum Private Equality Comparison scheme relying on $|GH{Z}_3⟩$ states
• An entanglement-based protocol for simultaneous reciprocal information exchange between 2 players
• One-to-Many Simultaneous Secure Quantum Information Transmission
• A distributed and parallel $(k,n)$ QSS scheme with verification capability
• Quantum Shadows: The Dining Information Brokers
• Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou
• A novel $2$ \& $3$ player scheme for Quantum Direct Communication
• A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem