Efficient Fault-Tolerant Quantum Protocol for Differential Privacy in the Shuffle Model
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916384661831680 |
|---|---|
| author | Asghar, Hassan Jameel Mukherjee, Arghya Brennen, Gavin K. |
| author_facet | Asghar, Hassan Jameel Mukherjee, Arghya Brennen, Gavin K. |
| contents | We present a quantum protocol which securely and implicitly implements a random shuffle to realize differential privacy in the shuffle model. The shuffle model of differential privacy amplifies privacy achievable via local differential privacy by randomly permuting the tuple of outcomes from data contributors. In practice, one needs to address how this shuffle is implemented. Examples include implementing the shuffle via mix-networks, or shuffling via a trusted third-party. These implementation specific issues raise non-trivial computational and trust requirements in a classical system. We propose a quantum version of the protocol using entanglement of quantum states and show that the shuffle can be implemented without these extra requirements. Our protocol implements k-ary randomized response, for any value of k > 2, and furthermore, can be efficiently implemented using fault-tolerant computation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_04026 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Fault-Tolerant Quantum Protocol for Differential Privacy in the Shuffle Model Asghar, Hassan Jameel Mukherjee, Arghya Brennen, Gavin K. Quantum Physics Cryptography and Security We present a quantum protocol which securely and implicitly implements a random shuffle to realize differential privacy in the shuffle model. The shuffle model of differential privacy amplifies privacy achievable via local differential privacy by randomly permuting the tuple of outcomes from data contributors. In practice, one needs to address how this shuffle is implemented. Examples include implementing the shuffle via mix-networks, or shuffling via a trusted third-party. These implementation specific issues raise non-trivial computational and trust requirements in a classical system. We propose a quantum version of the protocol using entanglement of quantum states and show that the shuffle can be implemented without these extra requirements. Our protocol implements k-ary randomized response, for any value of k > 2, and furthermore, can be efficiently implemented using fault-tolerant computation. |
| title | Efficient Fault-Tolerant Quantum Protocol for Differential Privacy in the Shuffle Model |
| topic | Quantum Physics Cryptography and Security |
| url | https://arxiv.org/abs/2409.04026 |