|
| | | | |
| | | |
| Stat |
Members: 3644
Articles: 2'499'343
Articles rated: 2609
16 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Large N Quantum Cryptography | | Adrian Kent
; | | Date: |
8 Dec 2002 | | Journal: | in "Quantum Communication, Measurement and Computing (QCMC’02)", J. Shapiro and O. Hirota (eds), Rinton Press (2003) | | Subject: | Quantum Physics; Cryptography and Security | quant-ph cs.CR | | Affiliation: | Centre for Quantum Computation, University of Cambridge | | Abstract: | 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. | | Source: | arXiv, quant-ph/0212043 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER