A quantitative doxastic logic for probabilistic processes and applications to information-hiding

We introduce a novel modal logic, namely the doxastic μ-calculus with error control (DμCEC), and propose a formalization of probabilistic anonymity and oblivious transfer in the logic, and the validation of these formalizations on implementations formalized in probabilistic CCS. The distinguishing feature of our logic is to provide a combination of dynamic operators for belief (whence the attribute “doxastic”) with a control on the possible error of apprehension of the perceived reality, and for internalized probability. Both operators are dynamic (non-monotonic) thanks to the possibility of combining them with temporal operators, and are parameterized with a lower and upper probability bound (the error control).

[1]  Abbas Edalat,et al.  A logical characterization of bisimulation for labeled Markov processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[2]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[3]  Mogens Nielsen Reasoning About the Past , 1998, MFCS.

[4]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[5]  Joseph Y. Halpern,et al.  Probabilistic algorithmic knowledge , 2003, TARK '03.

[6]  Joe Kilian,et al.  Founding crytpography on oblivious transfer , 1988, STOC '88.

[7]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2005 .

[8]  Roberto Segala,et al.  Logical Characterizations of Bisimulations for Discrete Probabilistic Systems , 2007, FoSSaCS.

[9]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[10]  Catuscia Palamidessi,et al.  Making Random Choices Invisible to the Scheduler , 2007, CONCUR.

[11]  Sachin Lodha,et al.  Probabilistic Anonymity , 2007, PinKDD.

[12]  Prakash Panangaden,et al.  Formal Approaches to Information-Hiding (Tutorial) , 2007, TGC.

[13]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[14]  Catuscia Palamidessi,et al.  Making random choices invisible to the scheduler , 2010, Inf. Comput..

[15]  Michaël Rusinowitch,et al.  Relating two standard notions of secrecy , 2006, Log. Methods Comput. Sci..

[16]  Roberto Segala Probability and Nondeterminism in Operational Models of Concurrency , 2006, CONCUR.

[17]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[18]  Catuscia Palamidessi,et al.  A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange , 2005, TGC.

[19]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[20]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[21]  Wojciech Penczek,et al.  Symbolic model checking for temporal-epistemic logics , 2007, SIGA.

[22]  Simona Orzan,et al.  Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap , 2007, LPAR.