ACM Transactions on Computer Systems (TOCS)
Reasoning about knowledge
Reasoning about knowledge: a survey
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
An authentication logic supporting synchronization, revocation, and recency
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Athena: a novel approach to efficient automatic security protocol analysis
Journal of Computer Security
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
A Logic for Constraint-based Security Protocol Analysis
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Deductive Algorithmic Knowledge
Journal of Logic and Computation
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
A Complete Axiomatization of Knowledge and Cryptography
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Analysing protocols subject to guessing attacks
Journal of Computer Security - Special issue on WITS'02
Efficient representation of the attacker’s knowledge in cryptographic protocols analysis
Formal Aspects of Computing
Deciding knowledge in security protocols for monoidal equational theories
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
| Hi-index | 0.00 |
An effective representation of principals' knowledge can greatly improve the efficiency of cryptographic protocol analysis. In this paper, we propose a mechanism to represent the deductive knowledge contained in a set of terms. Using Dolev-Yao model as an example, we design two algorithms to generate the knowledge representation and derive terms, respectively. We prove that using our knowledge representation, a principal can derive a term by using only constructive operations. To demonstrate the advantages of the proposed approach, we integrate it with Athena to build a new protocol verifier. The new approach will drastically reduce the number of states that are generated and analyzed during protocol verification. Experiments on several cryptographic protocols widely used for evaluating protocol verifiers demonstrate the improvements.