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

DOI10.3166/JANCL.19.489-516zbMath1186.68325MaRDI QIDQ5188177

Catuscia Palamidessi, Christelle Braun, Andrea Turrini, Simon Kramer, Roberto Segala

Publication date: 10 March 2010

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

zbMATH Keywords

multi-agent systemsoblivious transferanonymity and information-hidingdoxastic \(\mu\)-calculus with error controlprobabilistic process calculi

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Agent technology and artificial intelligence (68T42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Approximate analyzing of labeled transition systems ⋮ Conditional anonymity with non-probabilistic adversary

Cites Work

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
• Probabilistic Algorithmic Knowledge
• Relating two standard notions of secrecy

This page was built for publication: A quantitative doxastic logic for probabilistic processes and applications to information-hiding