Quantum Solutions to the Privacy vs. Utility Tradeoff
Sagnik Chatterjee, Vyacheslav Kungurtsev

TL;DR
This paper introduces a quantum cryptography-based architecture that enhances privacy guarantees for generative models, outperforming traditional differential privacy methods against polynomial-time adversaries.
Contribution
It presents a novel quantum architecture with variants that provide provable privacy and security for generative models, applicable on classical and quantum systems.
Findings
Quantum architecture offers inherent security advantages.
Provable privacy guarantees against polynomial-time adversaries.
Compatible with existing generative models.
Abstract
In this work, we propose a novel architecture (and several variants thereof) based on quantum cryptographic primitives with provable privacy and security guarantees regarding membership inference attacks on generative models. Our architecture can be used on top of any existing classical or quantum generative models. We argue that the use of quantum gates associated with unitary operators provides inherent advantages compared to standard Differential Privacy based techniques for establishing guaranteed security from all polynomial-time adversaries.
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
TopicsCryptography and Data Security · Blockchain Technology Applications and Security · Quantum Computing Algorithms and Architecture
