论文标题
快速保护隐私的打孔卡
Fast Privacy-Preserving Punch Cards
论文作者
论文摘要
长期以来，以打孔卡形式的忠诚度计划是消费者景观的无处不在的元素。但是，他们越来越流行的数字等效物在提供更多便利性和更好的簿记中，构成了很大的隐私风险。本文介绍了保存隐私的打孔卡协议，该协议允许公司数字化其忠诚度计划而不强迫客户提交公司监视。我们还提出了许多扩展，使我们的计划可以提供其他保护隐私的客户忠诚度功能。 与最佳的先前工作相比，我们在计算中减少了$ 14 \ times $ $ $ $ \ times $ $ $ $减少执行“孔打孔”所需的通信，兑换打孔卡所需的通信和$ 128 \ times $缩短兑换卡所需的$ 128 \ times $ $。我们的大部分绩效改进可以归因于消除对先前工作中存在的配对或范围证明的依赖，这仅在更一般的忠诚度系统的背景下解决了这个问题。通过对打孔卡和相关的忠诚度系统量身定制计划，我们证明我们可以通过数量级来降低沟通和计算成本。
Loyalty programs in the form of punch cards that can be redeemed for benefits have long been a ubiquitous element of the consumer landscape. However, their increasingly popular digital equivalents, while providing more convenience and better bookkeeping, pose a considerable privacy risk. This paper introduces a privacy-preserving punch card protocol that allows firms to digitize their loyalty programs without forcing customers to submit to corporate surveillance. We also present a number of extensions that allow our scheme to provide other privacy-preserving customer loyalty features. Compared to the best prior work, we achieve a $14\times$ reduction in the computation and a $11\times$ reduction in the communication required to perform a "hole punch," a $55\times$ reduction in the communication required to redeem a punch card, and a $128\times$ reduction in the computation time required to redeem a card. Much of our performance improvement can be attributed to removing the reliance on pairings or range proofs present in prior work, which has only addressed this problem in the context of more general loyalty systems. By tailoring our scheme to punch cards and related loyalty systems, we demonstrate that we can reduce communication and computation costs by orders of magnitude.
