Large N Quantum Cryptography
| dc.creator | Kent, Adrian | |
| dc.date | 2002-12-08 | |
| dc.date.accessioned | 2026-07-07T06:05:40Z | |
| dc.date.available | 2026-07-07T06:05:40Z | |
| dc.description | 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. | |
| dc.description | 6 pages. To appear in Proceedings of QCMC02 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0212043 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0212043 | |
| dc.identifier | in "Quantum Communication, Measurement and Computing (QCMC'02)", J. Shapiro and O. Hirota (eds), Rinton Press (2003) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90711 | |
| dc.subject | Quantum Physics | |
| dc.subject | Cryptography and Security | |
| dc.title | Large N Quantum Cryptography | |
| dc.type | text |