Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy

DOI10.1016/J.DAM.2015.06.022zbMATH Open1356.94090DBLPjournals/dam/DuqueG16arXiv1407.7582OpenAlexW1551579511WikidataQ58883274 ScholiaQ58883274MaRDI QIDQ897593FDOQ897593

Authors: David Fernández-Duque, Valentin Goranko 

Publication date: 7 December 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: We consider the generic problem of Secure Aggregation of Distributed Information (SADI), where several agents acting as a team have information distributed among them, modeled by means of a publicly known deck of cards distributed among the agents, so that each of them knows only her cards. The agents have to exchange and aggregate the information about how the cards are distributed among them by means of public announcements over insecure communication channels, intercepted by an adversary "eavesdropper", in such a way that the adversary does not learn who holds any of the cards. We present a combinatorial construction of protocols that provides a direct solution of a class of SADI problems and develop a technique of iterated reduction of SADI problems to smaller ones which are eventually solvable directly. We show that our methods provide a solution to a large class of SADI problems, including all SADI problems with sufficiently large size and sufficiently balanced card distributions.

Full work available at URL: https://arxiv.org/abs/1407.7582

Recommendations

• Perfectly secure data aggregation via shifted projections
• Who holds the best card? Secure communication of optimal secret bits
• Three steps
• Secure grouping protocol using a deck of cards
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

zbMATH Keywords

multi-agent systemsgeneralized Russian cards problemssafe and informative protocolssecure information exchange

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• A colouring protocol for the generalized Russian cards problem
• The Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computations with a deck of cards
• Unconditional secure communication: a Russian cards protocol
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• A geometric protocol for cryptography with cards

Cited In (4)

• Title not available (Why is that?)
• Crossing hands in the Russian cards problem
• Symbolic Model Checking for Dynamic Epistemic Logic
• A case study in almost-perfect security for unconditionally secure communication

This page was built for publication: Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897593)