Dining Cryptographers Revisited

By Philippe Golle, Ari Juels. 2004

182 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Practical Secure Aggregation for Federated Learning on User-Held Data (2016, background): “To construct perturbations, we assume a total ordering on U and take p u,v = PRG ( s u,v ) for u < v , p u,v = − PRG ( s u,v ) for u > v , and p u,v = 0 for u = v (as before).”
Proactively Accountable Anonymous Messaging in Verdict (2012, methodology): “At Verdict's core lies a verifiable DC-net primitive, derived from theoretical work proposed and formalized by Golle and Juels [25], which requires participating nodes to prove proactively the well-formedness of messages they send.”
Riposte: An Anonymous Messaging System Handling Millions of Users (2015, methodology): “Recent work [26] uses zero-knowledge techniques to speed up disruption resistance in Dissent (building on ideas of Golle and Juels [50]).”
Anonymity-preserving data collection (2005, background): “General-purpose ways to build anonymous channels include mix networks [3, 24, 29, 20, 18], dining cryptographer networks (DC-nets) [4, 36, 17] and k -anonymous message transmission [35], all of which are still under active study.”
Towards efficient traffic-analysis resistant anonymity networks (2013, background): “Dining cryptographers (D-C) nets [6, 16] and verifiable shuffles [13, 22, 31] are cryptographic techniques that offer strong resistance to traffic analysis without requiring batching.”
Dissent in Numbers: Making Strong Anonymity Scale (2012, unknown): “Two other approaches to anonymity theoretically offer security even against traffic analysis: verifiable shuffles [11, 32, 44], and “dining cryptographers” or DCnets [14, 36, 58].”
Practical Secure Aggregation for Privacy-Preserving Machine Learning (2017, methodology): “Dining cryptographers networks, or DC-nets, are a type of communication network which provide anonymity by using pairwise blinding of inputs [29], [30], similarly to our secure aggregation protocol.”
Privacy-Friendly Aggregation for the Smart-Grid (2011, methodology): “As noted by [12], the map e can be instantiated with the Weil pairing over a suitable elliptic curve.”
Dissent: accountable anonymous group messaging (2010, background): “Strategies exist to strengthen DCnets against DoS attacks [22, 40], or to form new groups when an attack is detected [32].”
This Paper Is Included in the Proceedings of the 12th Usenix Symposium on Operating Systems Design and Implementation (osdi '16). Unobservable Communication over Fully Untrusted Infrastructure Unobservable Communication over Fully Untrusted Infrastructure (unknown): “There are proposals that do not require trusting the communication infrastructure [26] [33] [42] [60] [66] [131], but they have been primarily theoretical since the resulting systems support only dozens of concurrent users.”