Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network

@article{Beals2008DistributedRP,
  title={Distributed Relay Protocol for Probabilistic Information-Theoretic Security in a Randomly-Compromised Network},
  author={Travis R. Beals and Barry C. Sanders},
  journal={ArXiv},
  year={2008},
  volume={abs/0803.2919}
}
We introduce a simple, practical approach with probabilistic information-theoretic security to mitigate one of quantum key distribution's major limitations: the short maximum transmission distance (~200 km) possible with present day technology. Our scheme uses classical secret sharing techniques to allow secure transmission over long distances through a network containing randomly-distributed compromised nodes. The protocol provides arbitrarily high confidence in the security of the protocol… 
Securing a quantum key distribution relay network using secret sharing
TLDR
A simple new technique to secure quantum key distribution relay networks using secret sharing that utilizes a random ‘drop-out’ scheme to ensure that an attacker must compromise all of the relays on the channel in order to access the key.
Security of trusted repeater quantum key distribution networks
TLDR
This paper presents an example of a trusted repeater QKD network, developed within the SECOQC project, and proposes an original method, able to ensure the authenticity and privacy of the generated secret keys.
Asynchronous quantum key distribution on a relay network
We show how quantum key distribution on a multi-user, multi-path, network can be used to establish a key between any two end-users in an asynchronous fashion using the technique of bit-transport. By
Analysis of Multiple Overlapping Paths algorithms for Secure Key Exchange in Large-Scale Quantum Networks
TLDR
It is proved that introducing overlapping paths allows one to increase the security of the protocol, compared to the non-overlapping case with the same number of additional links added, and may have application in optimising architectures of large-scale (hybrid) quantum networks.
The Security of Simplified Trusted Relays
TLDR
This thesis examines the security of an STR protocol which carries out the quantum phase of the BB84 protocol and derives qubit key rates through two different methods, providing a framework for generalizing decoy state methods to STR protocols.
Advantage of the key relay protocol over secure network coding
TLDR
Differences and similarities between the KRP and SNC are analyzed rigorously and it is found that there is a definite gap in security; that is, certain KRPs achieve better security than any SNC schemes on the same graph.
Asynchronous QKD on a Relay Network
TLDR
It is shown how QKD on a multi-user, multi-path, network can be used to establish a key between any two end users in an asynchronous fashion using the technique of bit-transport and shows that an attacker has to compromise all of the intermediate relays on the network in order to obtain the key.
The Case for Quantum Key Distribution
TLDR
It is argued that QKD will be an important part of future cryptographic infrastructures because it can provide long-term confidentiality for encrypted information without reliance on computational assumptions.
Quantum key distribution and cryptography: a survey
I will try to partially answer, based on a review on recent work, the following question: Can QKD and more generally quantum information be useful to cover some practical security requirements in
Relay QKD Networks & Bit Transport
TLDR
It is demonstrated that it is possible to create a simple quantum key exchange scheme using secret sharing such that by the addition of a single extra relay on a multi-relay channel requires the eavesdropper to compromise all the relays on the channel.
...
...

References

SHOWING 1-10 OF 19 REFERENCES
On Unconditionally Secure Robust Distributed Key Distribution Centers
TLDR
This paper proposes an unconditionally secure scheme to set up a robust Distributed Key Distribution Center that keeps working even if some minority of the servers malfunction or misbehave under the control of a mobile adversary.
Information-theoretic security proof for quantum-key-distribution protocols (17 pages)
TLDR
This work investigates a general class of QKD protocols with one-way classical post-processing and gives new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute.
An information-theoretic security proof for QKD protocols
TLDR
A new technique based on direct information-theoretic arguments is presented, which gives new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute.
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
TLDR
In order to guarantee the availability and integrity of the secret, this work provides mechanisms to detect maliciously (or accidentally) corrupted shares, as well as mechanisms to secretly recover the correct shares when modification is detected.
How To Withstand Mobile Virus Attacks
We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the network, analogous to a spread of a virus or a worm. We show how local
How to withstand mobile virus attacks (extended abstract)
We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm. We show how local
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
TLDR
This work presents a scheme of a quantum repeater that connects a string of (imperfect) entangled pairs of particles by using a novel nested purification protocol, thereby creating a single distant pair of high fidelity.
Advances in Cryptology — ASIACRYPT 2002
  • Yuliang Zheng
  • Computer Science
    Lecture Notes in Computer Science
  • 2002
TLDR
It is concluded that from a practical standpoint, the security of RSA relies exclusively on the hardness of the relation collection step of the number field sieve.
Quantum cryptography based on Bell's theorem.
  • Ekert
  • Mathematics, Physics
    Physical review letters
  • 1991
Practical application of the generalized Bells theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohms version of the
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Every function of <italic>n</italic> inputs can be efficiently computed by a complete network of <italic>n</italic> processors in such a way that:<list><item>If no faults occur, no set of size
...
...