# Quantum Measurement Adversary

@article{Aggarwal2021QuantumMA, title={Quantum Measurement Adversary}, author={Divesh Aggarwal and Naresh Goud Boddu and Rahul Jain and Maciej Obremski}, journal={ArXiv}, year={2021}, volume={abs/2106.02766} }

Multi-source-extractors are functions that extract uniform randomness from multiple (weak) sources of randomness. Quantum multi-source-extractors were considered by Kasher and Kempe [27] (for the quantum-independent-adversary and the quantum-bounded-storage-adversary), Chung, Li and Wu [13] (for the general-entangled-adversary) and Arnon-Friedman, Portmann and Scholz [2] (for the quantum-Markov-adversary). One of the main objectives of this work is to unify all the existing quantum multi-source…

## 3 Citations

Quantum secure non-malleable-codes in the split-state model

- Computer Science, MathematicsArXiv
- 2022

This work considers the security of non-malleable codes in the split-state model when the adversary is allowed to make use of arbitrary entanglement to tamper the parts X and Y.

Quantum secure non-malleable-extractors

- Mathematics, Computer ScienceArXiv
- 2021

This work constructs several explicit quantum secure non-malleable-extractors based on the constructions by Chattopadhyay, Goyal and Li [CGL20] and Cohen [Coh15], and constructs the first explicit Quantum Secure Non-Malleable Extractor for (source) minentropy k ≥ poly.

A direct product theorem for quantum communication complexity with applications to device-independent QKD

- Computer Science, Mathematics2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
- 2022

It is shown that it is possible to do device-independent quantum key distribution (DIQKD) without the assumption that devices do not leak any information after inputs are provided to them, and a direct product theorem is given for two-input functions or relations whose outputs are non-boolean as well.

## References

SHOWING 1-10 OF 51 REFERENCES

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications

- Computer ScienceElectron. Colloquium Comput. Complex.
- 2014

A new model called General Entangled (GE) Adversary Model, which allows arbitrary entanglement in the side information and subsumes both the IA model and the BS model is proposed, and equivalence between strong OA-security and strong GE-security is established.

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.

Two-Source Extractors Secure Against Quantum Adversaries

- Computer Science, MathematicsTheory Comput.
- 2010

This work reports a two-source extractor secure against quantum adversaries, with parameters closely matching the classical case and tight in several instances, even if the adversaries share entanglement.

A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

The first construction of a non-malleable extractor that is secure against quantum adversaries is given, based on a construction by Li (FOCS'12), and is able to extract from source of min-entropy rates larger than $1/2.

Near-optimal extractors against quantum storage

- Computer Science, MathematicsSTOC '10
- 2010

It is shown that Trevisan's extractor and its variants [22,19] are secure against bounded quantum storage adversaries and based on bounds for a generalization of quantum random access codes, which are called quantum functional access codes.

The Bounded-Storage Model in the Presence of a Quantum Adversary

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2008

It is proved that certain extractors are suitable for key expansion in the bounded-storage model where the adversary has a limited amount of quantum memory.

Classical and Quantum Partition Bound and Detector Inefficiency

- Computer ScienceICALP
- 2012

For one- way communication, it is shown that the quantum one-way partition bound is tight for classical communication with shared entanglement up to arbitrarily small error.

Short seed extractors against quantum storage

- Computer ScienceSTOC '09
- 2009

A modified version of Trevisan's extractor is shown to be good even against quantum storage, thereby giving the first such construction with logarithmic seed length.

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness

- Mathematics, Computer Science2009 50th Annual IEEE Symposium on Foundations of Computer Science
- 2009

If such one-way permutations exist, and enhanced trapdoor permutation exist, then secure multiparty computation with imperfect randomness {\em is possible} for any number of players, as long as at least two of them are honest.

Exponential separations for one-way quantum communication complexity, with applications to cryptography

- Computer Science, MathematicsSTOC '07
- 2007

We give an exponential separation between one-way quantum and classical communication protocols for twopartial Boolean functions, both of which are variants of the Boolean Hidden Matching Problem of…