Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security
Journal of Cryptology
Improving the Security of Quantum Protocols via Commit-and-Open
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Sampling in a quantum population, and applications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Sampling in a quantum population, and applications
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Lower bounds for quantum oblivious transfer
Quantum Information & Computation
| Hi-index | 0.01 |
We propose a framework for analyzing classical sampling strategies for estimating the Hamming weight of a large string from a few sample positions, when applied to a multi-qubit quantum system instead. The framework shows how to interpret the result of such a strategy and how to define its accuracy when applied to a quantum system. Furthermore, we show how the accuracy of any strategy relates to its accuracy in its classical usage, which is well understood for the important examples. We show the usefulness of our framework by using it to obtain new and simple security proofs for the following quantum-cryptographic schemes: BB84 quantum-key-distribution, and quantum oblivious-transfer from bit-commitment.