e0742cf8ab1130a62a31 · Is Quantum Cryptography Provably Secure?
Is Quantum Cryptography Provably Secure?
Quantum cryptography asserts that shared secrets can be established over public channels in such a way that the total information of an eavesdropper can be made arbitrarily small with probability arbitrarily close to 1. As we will show below, the current
{
"title_en": "Is Quantum Cryptography Provably Secure?",
"designation": "",
"series": "",
"status": "",
"date": "2006-04-01",
"date_original": "April 1, 2006",
"url": "https://www.nist.gov/publications/quantum-cryptography-provably-secure-0",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Anastase Nakassis , Joshua Bienfang , P. Johnson, Alan Mink , D. Rogers, Xiao Tang , Carl J. Williams",
"abstract_excerpt_en": "Quantum cryptography asserts that shared secrets can be established over public channels in such a way that the total information of an eavesdropper can be made arbitrarily small with probability arbitrarily close to 1. As we will show below, the current",
"id": "e0742cf8ab1130a62a31",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Is Quantum Cryptography Provably Secure?",
"designation": "",
"series": "",
"status": "",
"date": "2006-04-01",
"date_original": "April 1, 2006",
"url": "https://www.nist.gov/publications/quantum-cryptography-provably-secure-0",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Anastase Nakassis , Joshua Bienfang , P. Johnson, Alan Mink , D. Rogers, Xiao Tang , Carl J. Williams",
"abstract_excerpt_en": "Quantum cryptography asserts that shared secrets can be established over public channels in such a way that the total information of an eavesdropper can be made arbitrarily small with probability arbitrarily close to 1. As we will show below, the current"
}
],
"translation_state": "none",
"possible_title_matches": 1
}