2019
DOI: 10.1109/tit.2019.2929564
|View full text |Cite
|
Sign up to set email alerts
|

Entropy Accumulation With Improved Second-Order Term

Abstract: The entropy accumulation theorem [1] states that the smooth min-entropy of an n-partite system A = (A1, . . . , An) is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are sublinear in n. This theorem is particularly suited to proving the security of quantum cryptographic protocols, and in particular so-called device-independent protocols for randomness expansion and key distribution, where the devices can be built and preprogrammed by a malicio… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
111
1

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 66 publications
(114 citation statements)
references
References 41 publications
2
111
1
Order By: Relevance
“…5). The rates of Protocol ARV are also evaluated using the improved EAT statement [23]. For Protocol ARV, we use the one-sided von Neumann entropy bound, so the maximum rate is one bit per round, but because we can directly get the single-round von Neumann entropy, the rate initially falls more slowly with decreasing detection efficiency than for the other protocols.…”
Section: Rates In the Presence Of Inefficient Detectorsmentioning
confidence: 99%
See 2 more Smart Citations
“…5). The rates of Protocol ARV are also evaluated using the improved EAT statement [23]. For Protocol ARV, we use the one-sided von Neumann entropy bound, so the maximum rate is one bit per round, but because we can directly get the single-round von Neumann entropy, the rate initially falls more slowly with decreasing detection efficiency than for the other protocols.…”
Section: Rates In the Presence Of Inefficient Detectorsmentioning
confidence: 99%
“…In particular, this demonstrated the original EAT statement's suboptimal dependence on the testing probability. In light of this, the authors of [23] improved the second order term of the EAT in order to account for this suboptimal dependence. In the sections that follow, we will look at how the modified protocol structure interacts with the improved EAT statement.…”
Section: B3 Input Randomness For Protocol Qrementioning
confidence: 99%
See 1 more Smart Citation
“…The security of DIQKD has been rigorously established in different works, first against collective attacks [15] in the asymptotic regime, then against coherent attacks [17] also in the asymptotic regime, and only recently in the practical scenario of finite data block sizes [28] (see also [29]). The security proof in [28] relies on the socalled entropy accumulation theorem [30,31], which effectively allows to prove the security of the full protocol from the security of a single round of the protocol by using a worst-case scenario.…”
Section: Introductionmentioning
confidence: 99%
“…A more detailed explanation can be found in [39,Appendix B]. Improvements on the second order term of the entropy accumulation theorem, that do not rely on the introduction of blocks, were recently obtained in [62]. Following the techniques of [1,39], we derive Theorem 1.…”
mentioning
confidence: 99%