ACM Transactions on Computer Systems (TOCS)
Reasoning about knowledge
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From Secrecy to Authenticity in Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Formal Analysis of Multiparty Contract Signing
Journal of Automated Reasoning
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
A Logical Characterisation of Static Equivalence
Electronic Notes in Theoretical Computer Science (ENTCS)
A Complete Axiomatization of Knowledge and Cryptography
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Knowledge-based modelling of voting protocols
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Verifying privacy-type properties of electronic voting protocols
Journal of Computer Security
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
${\mathcal PS}$-LTL for constraint-based security protocol analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Epistemic temporal logic for information flow security
Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security
Combining epistemic logic and hennessy-milner logic
Logic and Program Semantics
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Privacy by design: a formal framework for the analysis of architectural choices
Proceedings of the third ACM conference on Data and application security and privacy
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
| Hi-index | 0.00 |
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as equivalences . While process calculi provide a natural means to describe the protocols themselves, epistemic logics are often better suited for expressing certain security properties such as secrecy and anonymity. We intend to bridge the gap between these two approaches: using the set of traces generated by a process as models, we define a logic which has constructs for reasoning about both intruder's epistemic knowledge and the set of messages in possession of the intruder. As an example we consider two formalizations of privacy in electronic voting and study the relationship between them.