Quantum Measurement Adversary
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski

TL;DR
This paper introduces two new quantum adversary models for multi-source extractors, demonstrates their relative strength, and proves the security of several extractors and protocols against these models, advancing quantum cryptography.
Contribution
It unifies existing quantum adversary models, introduces the strongest quantum measurement adversary, and proves security of extractors and protocols against these models.
Findings
Quantum measurement adversary is the strongest known adversary.
Generalized inner-product functions remain effective extractors against quantum adversaries.
Non-malleable extractors are secure against quantum side-information.
Abstract
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 (for the quantum-independent-adversary and the quantum-bounded-storage-adversary), Chung, Li and Wu (for the general-entangled-adversary) and Arnon-Friedman, Portmann and Scholz (for the quantum-Markov-adversary). One of the main objectives of this work is to unify all the existing quantum multi-source adversary models. We propose two new models of adversaries: 1) the quantum-measurement-adversary (qm-adv), which generates side-information using entanglement and on post-measurement and 2) the quantum-communication-adversary (qc-adv), which generates side-information using entanglement and communication between multiple sources. We show that, 1. qm-adv is the strongest adversary among all the known…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
