# (Quantum) Min-Entropy Resources

@article{Portmann2017QuantumMR, title={(Quantum) Min-Entropy Resources}, author={Christopher Portmann}, journal={ArXiv}, year={2017}, volume={abs/1705.10595} }

We model (interactive) resources that provide Alice with a string $X$ and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system $E$ such that the conditional (smooth) min-entropy of $X$ given $E$ is lower bounded by some $k$. This (abstract) resource specification encompasses any setting that results in the honest players holding such a string (or aborting). For example, it could be constructed from, e.g., noisy channels, quantum key distribution…

## 2 Citations

### Advances in Quantum Cryptography

- Computer Science
- 2019

This review begins by reviewing protocols of quantum key distribution based on discrete variable systems, and considers aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems.

## References

SHOWING 1-10 OF 45 REFERENCES

### A largely self-contained and complete security proof for quantum key distribution

- Computer Science, Mathematics
- 2015

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and…

### Device-independent quantum key distribution secure against collective attacks

- Computer Science
- 2009

This proof exploits the full structure of quantum theory, but only holds against collective attacks, where the eavesdropper is assumed to act on the quantum systems of the honest parties independently and identically in each round of the protocol.

### Quantum-proof multi-source randomness extractors in the Markov model

- Computer Science, MathematicsTQC
- 2016

It is proved that any multi-source extractor remains secure in the presence of quantum side information of this type (albeit with weaker parameters), which improves on previous results in which more restricted models were considered and the security of only some types of extractors was shown.

### Simple and Tight Bounds for Information Reconciliation and Privacy Amplification

- Computer ScienceASIACRYPT
- 2005

It is shown that the two new quantities, and related notions, do not only extend Shannon entropy in the described contexts, but they also share central properties of the latter such as the chain rule as well as sub-additivity and monotonicity.

### Duality Between Smooth Min- and Max-Entropies

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2010

In this paper, a recently discovered duality relation between (nonsmooth) min- and max-entropies is extended to the smooth case and it is shown that the smooth min-entropy of a system A conditioned on a system B equals the negative of the smooth max-Entropy of Acondition on a purifying system C.

### Security of quantum key distribution

- Computer ScienceAusgezeichnete Informatikdissertationen
- 2005

This work proposes an approach which allows us to study general physical systems for which the above mentioned independence condition does not necessarily hold, and introduces new uncertainty measures, called smooth min- and max-entropy, which are generalizations of information-theoretical notions.

### Impossibility of growing quantum bit commitments.

- Computer Science, MathematicsPhysical review letters
- 2011

This work considers another fundamental cryptographic task, commitments, and asks whether, given the ability to commit to a fixed number of bits, is there a way to augment this to commitments to strings of arbitrary length.

### Causal Boxes: Quantum Information-Processing Systems Closed Under Composition

- Computer ScienceIEEE Transactions on Information Theory
- 2017

By instantiating the abstract cryptography framework with causal boxes, this work obtains the first composable security framework that can handle arbitrary quantum protocols and relativistic protocols.

### Simple and tight device-independent security proofs

- Computer Science, MathematicsSIAM J. Comput.
- 2019

A flexible protocol is provided and a security proof is given that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries, which is likely that these protocols can be practically implemented in the near future.

### Theoretical framework for quantum networks

- Physics, Computer Science
- 2009

We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such…