Scholarlink

<p>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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\kappa \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>κ</mi> </math></EquationSource> </InlineEquation>-ary randomized response, for any value of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\kappa \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>κ</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, and furthermore, can be efficiently implemented using fault-tolerant computation.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient fault-tolerant quantum protocol for differential privacy in the shuffle model

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月18日

查看全文
  • Hassan Asghar,
  • Arghya Mukherjee,
  • Gavin K. Brennen

摘要

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 \(\kappa \) κ -ary randomized response, for any value of \(\kappa \ge 2\) κ ≥ 2 , and furthermore, can be efficiently implemented using fault-tolerant computation.