Min-entropy uncertainty relation for finite-size cryptography
Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The s...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/95182 http://hdl.handle.net/10220/9246 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-95182 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-951822023-02-28T19:39:21Z Min-entropy uncertainty relation for finite-size cryptography Ng, Nelly Huei Ying. Berta, Mario. Wehner, Stephanie. School of Physical and Mathematical Sciences DRNTU::Science::Mathematics::Discrete mathematics::Cryptography Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The smooth min-entropy Hminε(X/B) quantifies the negative logarithm of the probability for an attacker B to guess X, except with a small failure probability ε. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove an alternative uncertainty relation in terms of the smooth min-entropy that is only marginally less strong but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Rényi entropies that may be of independent interest. Published version 2013-02-25T06:40:26Z 2019-12-06T19:09:47Z 2013-02-25T06:40:26Z 2019-12-06T19:09:47Z 2012 2012 Journal Article Ng, N. H. Y., Berta, M., & Wehner, S. (2012). Min-entropy uncertainty relation for finite-size cryptography. Physical Review A, 86(4), 042315-. https://hdl.handle.net/10356/95182 http://hdl.handle.net/10220/9246 10.1103/PhysRevA.86.042315 en Physical review A © 2012 American Physical Society. This paper was published in Physical Review A and is made available as an electronic reprint (preprint) with permission of American Physical Society. The paper can be found at the following official DOI: [10.1103/PhysRevA.86.053620]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Science::Mathematics::Discrete mathematics::Cryptography |
spellingShingle |
DRNTU::Science::Mathematics::Discrete mathematics::Cryptography Ng, Nelly Huei Ying. Berta, Mario. Wehner, Stephanie. Min-entropy uncertainty relation for finite-size cryptography |
description |
Apart from their foundational significance, entropic uncertainty relations play a central role in proving the security of quantum cryptographic protocols. Of particular interest are therefore relations in terms of the smooth min-entropy for Bennett-Brassard 1984 (BB84) and six-state encodings. The smooth min-entropy Hminε(X/B) quantifies the negative logarithm of the probability for an attacker B to guess X, except with a small failure probability ε. Previously, strong uncertainty relations were obtained which are valid in the limit of large block lengths. Here, we prove an alternative uncertainty relation in terms of the smooth min-entropy that is only marginally less strong but has the crucial property that it can be applied to rather small block lengths. This paves the way for a practical implementation of many cryptographic protocols. As part of our proof we show tight uncertainty relations for a family of Rényi entropies that may be of independent interest. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Ng, Nelly Huei Ying. Berta, Mario. Wehner, Stephanie. |
format |
Article |
author |
Ng, Nelly Huei Ying. Berta, Mario. Wehner, Stephanie. |
author_sort |
Ng, Nelly Huei Ying. |
title |
Min-entropy uncertainty relation for finite-size cryptography |
title_short |
Min-entropy uncertainty relation for finite-size cryptography |
title_full |
Min-entropy uncertainty relation for finite-size cryptography |
title_fullStr |
Min-entropy uncertainty relation for finite-size cryptography |
title_full_unstemmed |
Min-entropy uncertainty relation for finite-size cryptography |
title_sort |
min-entropy uncertainty relation for finite-size cryptography |
publishDate |
2013 |
url |
https://hdl.handle.net/10356/95182 http://hdl.handle.net/10220/9246 |
_version_ |
1759854790897041408 |