Large N Quantum Cryptography
<|reference_start|>Large N Quantum Cryptography: In quantum cryptography, the level of security attainable by a protocol which implements a particular task $N$ times bears no simple relation to the level of security attainable by a protocol implementing the task once. Useful partial security, and even near-perfect security in an appropriate sense, can be obtained for $N$ copies of a task which itself cannot be securely implemented. We illustrate this with protocols for quantum bit string commitment and quantum random number generation between mistrustful parties.<|reference_end|>
@article{kent2002large,
    title={Large N Quantum Cryptography},
    author={Adrian Kent (Centre for Quantum Computation, University of Cambridge)},
    journal={in "Quantum Communication, Measurement and Computing (QCMC'02)",
  J. Shapiro and O. Hirota (eds), Rinton Press (2003)},
    year={2002},
    archivePrefix={arXiv},
    eprint={quant-ph/0212043},
    primaryClass={quant-ph cs.CR}
}