A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Secure Communication of Local States in Interpreted Systems
[chapter]
2011
Advances in Intelligent and Soft Computing
Given an interpreted system, we investigate ways for two agents to communicate secrets by public announcements. For card deals, the problem to keep all of your cards a secret (i) can be distinguished from the problem to keep some of your cards a secret (ii). For (i): we characterize a novel class of protocols consisting of two announcements, for the case where two agents both hold n cards and the third agent a single card; the communicating agents announce the sum of their cards modulo 2n + 1.
doi:10.1007/978-3-642-19934-9_15
dblp:conf/dcai/AlbertCDDJS11
fatcat:cvduadndhral3nl56ntdojesie