Scinovex
articleTop 10% cited

Quantum entanglement for secret sharing and secret splitting

Physical Review A · 1999 · Vol. 59(1) · pp. 162–168
Anders KarlssonMasato KoashiNobuyuki Imoto

Abstract

We show how a quantum secret sharing protocol, similar to that of Hillery, Buzek, and Berthiaume (Los Alamos e-print archive quant-ph/9806063), can be implemented using two-particle quantum entanglement, as available experimentally today. We also discuss in some detail how both two- and three-particle protocols must be carefully designed in order to detect eavesdropping or a dishonest participant. We also discuss the extension of a multiparticle entanglement secret sharing and splitting scheme toward a protocol so that m of n persons with $m<~n$ can retrieve the secret.

Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and ArchitectureQuantum entanglementPhysicsEavesdroppingProtocol (science)Secret sharingQuantumQuantum cryptographyExtension (predicate logic)Quantum mechanicsQuantum information

Funding

  • Vetenskapsrådet
  • Basic Research Laboratory
Citations
1,004
FWCI
10.44
field-weighted impact
References
21
Percentile
98%
vs. same field & year
Citations per year
Cited by
The security of practical quantum key distribution
Reviews of Modern Physics · 2009 · 3,528 citations
Efficient multiparty quantum-secret-sharing schemes
Physical Review A · 2004 · 830 citations
References
Multiparticle generalization of entanglement swapping
Physical Review A · 1998 · 726 citations
Quantum teleportation using three-particle entanglement
Physical Review A · 1998 · 921 citations
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Physical Review Letters · 1997 · 4,261 citations
Bell’s theorem without inequalities
American Journal of Physics · 1990 · 2,373 citations
Quantum cryptography based on Bell’s theorem
Physical Review Letters · 1991 · 10,462 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.