%0 Conference Proceedings
%T Shared-Dining: Broadcasting Secret Shares Using Dining-Cryptographers Groups
%+ Institute of Distributed Systems
%A Mödinger, David
%A Dispan, Juri
%A Hauck, Franz, J.
%Z Part 3: Distributed Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Valletta, Malta
%Y Miguel Matos
%Y Fabíola Greve
%I Springer International Publishing
%3 Distributed Applications and Interoperable Systems
%V LNCS-12718
%P 83-98
%8 2021-06-14
%D 2021
%R 10.1007/978-3-030-78198-9_6
%K Network protocol
%K Privacy protocol
%K Dining cryptographers
%K Secret sharing
%K Peer-to-Peer networking
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X We introduce a combination of Shamir’s secret sharing and dining-cryptographers networks, which provides $$(n-|\text {attackers}|)$$(n-|attackers|)-anonymity for up to $$k-1$$k-1 attackers and has manageable performance impact on dissemination. 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. 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. We demonstrate the privacy and performance 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-03384862/document
%2 https://inria.hal.science/hal-03384862/file/509420_1_En_6_Chapter.pdf
%L hal-03384862
%U https://inria.hal.science/hal-03384862
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-LNCS-12718