Secure communication of local states in multi-agent systems

Given a deal of cards over three agents, we investigate ways for two agents to communicate secrets by public announcements. 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. For (ii): we show that the problem to keep at least one of your cards a secret is equivalent to the problem to keep your local state (hand of cards) a secret; we provide a large class of card deals for which exchange of secrets is possible; and we give an example for which there is no protocol of less than three announcements.

[1]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[2]  Alan Ross Anderson,et al.  A REDUCTION OF DEONTIC LOGIC TO ALETHIC MODAL LOGIC , 1958 .

[3]  Paul Erdös,et al.  On the addition of residue classes mod p , 1964 .

[4]  J. Williamson,et al.  Action theory and social science , 1977 .

[5]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[6]  Michael J. Fischer,et al.  Multiparty Secret Key Exchange Using a Random Deal of Cards , 1991, CRYPTO.

[7]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8]  J. A. Dias da Silva,et al.  Cyclic Spaces for Grassmann Derivatives and Additive Theory , 1994 .

[9]  Nuel Belnap,et al.  The deliberative stit: A study of action, omission, ability, and obligation , 1995, J. Philos. Log..

[10]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[11]  Hans Weigand,et al.  Meeting the Deadline: On the Formal Specification of Temporal Deontic Constraints , 1996, ISMIS.

[12]  Frank Dignum,et al.  Combining dynamic deontic logic and temporal logic for the specification of deadlines , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

[13]  Lawrence C. Paulson,et al.  The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..

[14]  Stuart Staniford-Chen,et al.  Practical Automated Detection of Stealthy Portscans , 2002, J. Comput. Secur..

[15]  Hans Weigand,et al.  Formal Specification of Interaction in Agent Societies , 2002, FAABS.

[16]  Krister Segerberg.  "Some Meinong/Chisholm theses" , 2003 .

[17]  Hans van Ditmarsch,et al.  The Russian Cards Problem , 2003, Stud Logica.

[18]  Michael J. Fischer,et al.  Bounds on secret key exchange using a random deal of cards , 2004, Journal of Cryptology.

[19]  Frank Dignum,et al.  Designing a Deontic Logic of Deadlines , 2004, DEON.

[20]  Lennart Åqvist,et al.  Combinations of Tense and Deontic Modality , 2004, DEON.

[21]  Andreas Herzig,et al.  Obligation Change in Dependence Logic and Situation Calculus , 2004, DEON.

[22]  Mike D. Atkinson,et al.  Safe communication for card players by combinatorial designs for two-step protocols , 2005, Australas. J Comb..

[23]  Zhaoyu Liu,et al.  A Formal Definition for Trust in Distributed Systems , 2005, ISC.

[24]  Lea Kutvonen,et al.  Trust Management Survey , 2005, iTrust.

[25]  Vijay Varadharajan,et al.  Analysis and Modelling of Trust in Distributed Information Systems , 2005, ICISS.

[26]  Robert Demolombe,et al.  Norms with Deadlines in Dynamic Deontic Logic , 2006, ECAI.

[27]  Paul McNamara,et al.  Deontic logic , 2006, Logic and the Modalities in the Twentieth Century.

[28]  John-Jules Ch. Meyer,et al.  Intelligent agents and common sense reasoning , 2007, Handbook of Modal Logic.

[29]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[30]  Jan van Eijck,et al.  DEMO — A Demo of Epistemic Modelling , 2007 .

[31]  Audun Jøsang,et al.  A survey of trust and reputation systems for online service provision , 2007, Decis. Support Syst..

[32]  Andrew Twigg,et al.  The complexity of fixed point models of trust in distributed networks , 2007, Theor. Comput. Sci..

[33]  Douglas R. Stinson,et al.  Combinatorial designs: constructions and analysis , 2003, SIGA.

[34]  Nathalie Japkowicz,et al.  Using Unsupervised Learning for Network Alert Correlation , 2008, Canadian Conference on AI.

[35]  James Bret Michael,et al.  In Clouds Shall We Trust? , 2009, IEEE Secur. Priv..

[36]  Christoph Lüth,et al.  The Importance of Being Formal , 2009, Electron. Notes Theor. Comput. Sci..

[37]  Bruce Schneier.  Security, Group Size, and the Human Brain , 2009, IEEE Security & Privacy Magazine.

[38]  Yanjing Wang,et al.  Verifying epistemic protocols under common knowledge , 2009, TARK '09.

[39]  Philippe Balbiani,et al.  Group announcement logic , 2010, J. Appl. Log..

[40]  Jeremy Dawson,et al.  A Proof Theoretic Analysis of Intruder Theories , 2008, RTA.

[41]  W. Marsden.  I and J , 2012 .

[42]  Thomas Ågotnes,et al.  Deontic Logic in Computer Science , 2012, Lecture Notes in Computer Science.

[43]  Andrey Rybalchenko,et al.  A Multi-Modal Framework for Achieving Accountability in Multi-Agent Systems , 2022 .