Tripartite Counterfactual Quantum Cryptography
classification
🪐 quant-ph
keywords
partiesalicecharliecounterfactualcounterfactuallycryptographydistrustfulhelp
read the original abstract
We show how two distrustful parties, "Bob" and "Charlie", can share a secret key with the help of a mutually trusted "Alice", counterfactually - that is with no information-carrying particles travelling between any of the three parties.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.