arXiv 2409.040262024-09-06quant-phcs.CR

Shuffle模型中用于差分隐私的高效容错量子协议

Efficient Fault-Tolerant Quantum Protocol for Differential Privacy in the Shuffle Model

Hassan Jameel Asghar, Arghya Mukherjee, Gavin K. Brennen

AI总结：

针对shuffle模型中随机洗牌依赖混合网络或可信第三方的问题，论文利用量子纠缠提出安全隐式洗牌协议，支持任意k>2的k元随机响应，并可通过容错计算高效实现。

摘要：

我们提出一种量子协议，它能够安全且隐式地实现随机洗牌，从而在shuffle模型中实现差分隐私。差分隐私的shuffle模型通过随机置换来自数据贡献者的结果元组，放大经由本地差分隐私可获得的隐私保护。在实践中，人们需要解决如何实现这种洗牌的问题。例子包括通过混合网络实现洗牌，或通过受信任第三方进行洗牌。这些与实现相关的具体问题在经典系统中带来了非平凡的计算和信任要求。我们利用量子态的纠缠提出该协议的量子版本，并表明无需这些额外要求即可实现洗牌。我们的协议对任意k>2的值实现k元随机响应，而且可以利用容错计算高效实现。

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

AI总结：

摘要：

英文摘要：

相关论文