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.022zbMath1356.94090arXiv1407.7582OpenAlexW1551579511WikidataQ58883274 ScholiaQ58883274MaRDI QIDQ897593

David Fernández-Duque, Valentin F. Goranko

Publication date: 7 December 2015

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Symbolic Model Checking for Dynamic Epistemic Logic, Crossing hands in the Russian cards problem, Unnamed Item, A case study in almost-perfect security for unconditionally secure communication

Cites Work

• Unnamed Item
• Unnamed Item
• A colouring protocol for the generalized Russian cards problem
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• A geometric protocol for cryptography with cards
• Unconditional secure communication: a Russian cards protocol
• The Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Computations with a deck of cards