Yien Liang

We investigate the security of a quantum key distribution scheme, where Bob right after each detection announces publicly his choice of measurement basis, and the measurement results if the measurement is performed in the testing basis (used for parameter estimation). Such a scheme saves memory and communication time on both sides by not sending all the classical information only at the end of each block but immediately after each detection. We prove its security and show that this method will not reduce the key rate compared to conventional sifting.