13 citations · 72 across the 24 of their papers we have counts for
4 papers · 1 filter
Perfectly secure data aggregation via shifted projections
David Fernández-Duque
We study a general scenario where confidential information is distributed among a group of agents who wish to share it in such a way that the data becomes common knowledge among th…
A case study in almost-perfect security for unconditionally secure communication
Esteban Landerreche, David Fernández-Duque
In the Russian cards problem, Alice, Bob and Cath draw , and cards, respectively, from a publicly known deck. Alice and Bob must then communicate their cards to each oth…
Secure aggregation of distributed information: How a team of agents can safely share secrets in front of a spy
David Fernández-Duque, Valentin Goranko
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 m…
A geometric protocol for cryptography with cards
Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque +1
In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a,b and c cards, respectively, from a deck of a+b+c cards. Players only know their own cards an…