Finding Safety in Numbers with Secure Allegation Escrows
Venkat Arun, Aniket Kate, Deepak Garg, Peter Druschel, Bobby Bhattacharjee
摘要
For fear of retribution, the victim of a crime may be willing to report it only if other victims of the same perpetrator also step forward. Common examples include 1) identifying oneself as the victim of sexual harassment, especially by a person in a position of authority or 2) accusing an influential politician, an authoritarian government, or ones own employer of corruption. To handle such situations, legal literature has proposed the concept of an allegation escrow: a neutral third-party that collects allegations anonymously, matches them against each other, and de-anonymizes allegers only after de-anonymity thresholds (in terms of number of co-allegers), pre-specified by the allegers, are reached. An allegation escrow can be realized as a single trusted third party; however, this party must be trusted to keep the identity of the alleger and content of the allegation private. To address this problem, this paper introduces Secure Allegation Escrows (SAE, pronounced "say"). A SAE is a group of parties with independent interests and motives, acting jointly as an escrow for collecting allegations from individuals, matching the allegations, and de-anonymizing the allegations when designated thresholds are reached. By design, SAEs provide a very strong property: No less than a majority of parties constituting a SAE can de-anonymize or disclose the content of an allegation without a sufficient number of matching allegations (even in collusion with any number of other allegers). Once a sufficient number of matching allegations exist, the join escrow discloses the allegation with the allegers' identities. We describe how SAEs can be constructed using a novel authentication protocol and a novel allegation matching and bucketing algorithm, provide formal proofs of the security of our constructions, and evaluate a prototype implementation, demonstrating feasibility in practice.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- PentaGOD: Stepping beyond Traditional GOD with Five PartiesNishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj GopalCCS 2022 · 被引用 8 次
- Secure Account Recovery for a Privacy-Preserving Web ServiceRyan Little, Lucy Qin, Mayank VariaUSENIX Security 2024 · 被引用 7 次
它引用的顶会 Paper2
- Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable ComputationAntoine Delignat-Lavaud, Cédric Fournet, Markulf Kohlweiss, Bryan ParnoS&P 2016 · 被引用 83 次
- Blind Certificate AuthoritiesLiang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart 等S&P 2019 · 被引用 16 次
相关 Paper
- Shield: Secure Allegation Escrow System with Stronger GuaranteesNishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj GopalWWW 2023 · 被引用 1 次
- I'm In If You're In: Action Escrows as a Design Pattern to Achieve Social Change in Online CommunitiesPranav Khadpe, Lindsay Popowski, Lindy Le, Kyzyl Monteiro 等CSCW 2026
- Traceable Secret Sharing and ApplicationsVipul Goyal, Yifan Song, Akshayaram SrinivasanCRYPTO 2021 · 被引用 29 次
- Privacy-Preserving BlueprintsMarkulf Kohlweiss, Anna Lysyanskaya, An NguyenEUROCRYPT 2023 · 被引用 12 次
- Conan: Distributed Proofs of Compliance for Anonymous Data CollectionMingxun Zhou, Giulia Fanti, Elaine ShiCCS 2024 · 被引用 1 次
