Compare Papers
Paper 1
Repeat-Accumulate Codes for Reconciliation in Continuous Variable Quantum Key Distribution
Sarah J. Johnson, Vikram A. Chandrasetty, Andrew M. Lance
- Year
- 2015
- Journal
- arXiv preprint
- DOI
- arXiv:1510.03510
- arXiv
- 1510.03510
This paper investigates the design of low-complexity error correction codes for the verification step in continuous variable quantum key distribution (CVQKD) systems. We design new coding schemes based on quasi-cyclic repeat-accumulate codes which demonstrate good performances for CVQKD reconciliation.
Open paperPaper 2
Completely Device Independent Quantum Key Distribution
E. A. Aguilar, R. Ramanathan, J. Kofler, M. Pawlowski
- Year
- 2015
- Journal
- arXiv preprint
- DOI
- arXiv:1507.05752
- arXiv
- 1507.05752
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries -- an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence, our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
Open paper