Simple and tight device-independent security proofs
| dc.contributor.author | Arnon-Friedman, Rotem | en_ZA |
| dc.contributor.author | Renner, Renato | en_ZA |
| dc.contributor.author | Vidick, Thomas | en_ZA |
| dc.date.accessioned | 2021-11-10T14:11:56Z | |
| dc.date.available | 2021-11-10T14:11:56Z | |
| dc.date.issued | 2019-02-26 | |
| dc.description | CITATION: Arnon-Friedman, R., Renner, R. & Vidick, T. 2019. Simple and tight device-independent security proofs. SIAM Journal on Computing, 48(1), 181–225. doi:10.1137/18M1174726 | |
| dc.description | The original publication is available at https://epubs.siam.org/loi/smjcat | |
| dc.description.abstract | Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the laws of quantum mechanics, but it holds irrespective of any a priori assumptions on the quantum devices used in a protocol, making it particularly applicable in a quantum-wary environment. While the existence of device-independent protocols for tasks such as randomness expansion and quantum key distribution has recently been established, the underlying proofs of security remain very challenging, yield rather poor key rates, and demand very high quality quantum devices, thus making them all but impossible to implement in practice. We introduce a technique for the analysis of device-independent cryptographic protocols. We provide a flexible protocol and give a security proof that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries. At a high level our approach amounts to establishing a reduction to the scenario in which the untrusted device operates in an identical and independent way in each round of the protocol. This is achieved by leveraging the sequential nature of the protocol and makes use of a newly developed tool, the “entropy accumulation theorem” of Dupuis, Fawzi, and Renner [Entropy Accumulation, preprint, 2016]. As concrete applications we give simple and modular security proofs for device-independent quantum key distribution and randomness expansion protocols based on the CHSH inequality. For both tasks, we establish essentially optimal asymptotic key rates and noise tolerance. In view of recent experimental progress, which has culminated in loophole-free Bell tests, it is likely that these protocols can be practically implemented in the near future. | en_ZA |
| dc.description.uri | https://epubs.siam.org/doi/abs/10.1137/18M1174726?mobileUi=0 | |
| dc.description.version | Publisher’s version | |
| dc.format.extent | 45 pages | |
| dc.identifier.citation | Arnon-Friedman, R., Renner, R. & Vidick, T. 2019. Simple and tight device-independent security proofs. SIAM Journal on Computing, 48(1), 181–225. doi:10.1137/18M1174726 | |
| dc.identifier.issn | 1095-7111 (online) | |
| dc.identifier.issn | 0097-5397 (print) | |
| dc.identifier.other | doi:10.1137/18M1174726 | |
| dc.identifier.uri | http://hdl.handle.net/10019.1/123419 | |
| dc.language.iso | en_ZA | en_ZA |
| dc.publisher | Society for Industrial and Applied Mathematics | |
| dc.rights.holder | Society for Industrial and Applied Mathematics | |
| dc.subject | Quantum cryptography -- Security measures | en_ZA |
| dc.subject | Device independent security proofs | en_ZA |
| dc.subject | Asymptotic analysis | en_ZA |
| dc.subject | Security proofs | en_ZA |
| dc.subject | Random variables | en_ZA |
| dc.title | Simple and tight device-independent security proofs | en_ZA |
| dc.type | Article | en_ZA |