Shared-Dining: Broadcasting Secret Shares using Dining-Cryptographers Groups

by   David Mödinger, et al.

A k-anonymous broadcast can be implemented using a small group of dining cryptographers to first share the message, followed by a flooding phase started by group members. Members have little incentive to forward the message in a timely manner, as forwarding incurs costs, or they may even profit from keeping the message. In worst case, this leaves the true originator as the only sender, rendering the dining-cryptographers phase useless and compromising their privacy. We present a novel approach using a modified dining-cryptographers protocol to distributed shares of an (n,k)-Shamir's secret sharing scheme. Finally, all group members broadcast their received share through the network, allowing any recipient of k shares to reconstruct the message, enforcing anonymity. If less than k group members broadcast their shares, the message cannot be decoded thus preventing privacy breaches for the originator. Our system provides (n-|attackers|)-anonymity for up to k-1 attackers and has little performance impact on dissemination. We show these results in a security analysis and performance evaluation based on a proof-of-concept prototype. Throughput rates between 10 and 100 kB/s are enough for many real applications with high privacy requirements, e.g., financial blockchain system.


page 1

page 2

page 3

page 4


Arbitrary Length k-Anonymous Dining-Cryptographers Communication

Dining-cryptographers networks (DCN) can achieve information-theoretical...

Tightly Coupled Secret Sharing and Its Application to Group Authentication

Group oriented applications are getting more and more popular in today's...

A Faster Cryptographer's Conspiracy Santa

In Conspiracy Santa, a variant of Secret Santa, a group of people offer ...

A symmetric extensible protocol for quantum secret sharing

This paper introduces the Symmetric Extensible Quantum Secret Sharing pr...

A Proxy-Based Encrypted Online Social Network With Fine-Grained Access

When using Online Social Networks, users often share information with di...

Homomorphic Sortition – Secret Leader Election for Blockchain

In a secret single leader election protocol (SSLE), one of the system me...

Messaging with Purpose Limitation – Privacy-Compliant Publish-Subscribe Systems

Purpose limitation is an important privacy principle to ensure that pers...