Change search
ReferencesLink to record
Permanent link

Direct link
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
Stockholm University, Faculty of Humanities, Department of Philosophy.ORCID iD: 0000-0002-0157-1644
2016 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, E-ISSN 1872-6771, Vol. 198, 118-135 p.Article in journal (Refereed) Published
Abstract [en]

We consider the generic problem of Secure Aggregation of Distributed Information (SADI), where several agents acting as a team have information distributed amongst them, modelled by means of a publicly known deck of cards distributed amongst 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 amongst 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.

Place, publisher, year, edition, pages
2016. Vol. 198, 118-135 p.
Keyword [en]
Multi-agent systems, Secure information exchange, Safe and informative protocols, Generalized Russian cards problems
National Category
Discrete Mathematics
Research subject
Mathematics; Computer Science
URN: urn:nbn:se:su:diva-123443DOI: 10.1016/j.dam.2015.06.022ISI: 000366786000010OAI: diva2:874159
Available from: 2015-11-26 Created: 2015-11-26 Last updated: 2016-02-03Bibliographically approved

Open Access in DiVA

fulltext(365 kB)17 downloads
File information
File name FULLTEXT01.pdfFile size 365 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textFree full text

Search in DiVA

By author/editor
Goranko, Valentin
By organisation
Department of Philosophy
In the same journal
Discrete Applied Mathematics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 17 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 80 hits
ReferencesLink to record
Permanent link

Direct link