Tractable reasoning via approximation
Artificial Intelligence
Integration of weighted knowledge bases
Artificial Intelligence
Timestamps in key distribution protocols
Communications of the ACM
Security & Privacy for E-Business
Security & Privacy for E-Business
Protocols for Secure Electronic Commerce
Protocols for Secure Electronic Commerce
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Measuring inconsistency in knowledge via quasi-classical models
Eighteenth national conference on Artificial intelligence
Cryptography: A Very Short Introduction
Cryptography: A Very Short Introduction
Information-theoretically secure protocols and security under composition
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Formal Correctness of Security Protocols (Information Security and Cryptography)
Formal Correctness of Security Protocols (Information Security and Cryptography)
An integrated framework for security protocol analysis
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Uncertainty, belief, and probability
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Evaluating significance of inconsistencies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Executing SQL queries over encrypted character strings in the Database-As-Service model
Knowledge-Based Systems
| Hi-index | 0.00 |
Messages transmitted between senders and receivers might be inconsistent owing to potential communication block, message lost and/or malicious attacks, in electronic commerce. And current formal methods for security protocol analysis show limitations in handling the incoherent secure messages that may be derived from different sources or at different moments. This results in increasing risk of e-commerce activities. This paper thus proposes a formal framework to deal with the inconsistency in secure messages by weighting majority. The freshness and dynamics properties of secure messages are considered and a reliability function is developed to measure the belief in secure messages. This helps us verify protocols in an intuitive way and guarantees correct verification results. The experimental results demonstrate our method is useful in secure protocol analysis.