43 search results - page 5 / 9 » Probabilistic Polynomial-Time Semantics for a Protocol Secur... |
AMAST
2000
Springer
14 years 2 days ago
2000
Springer
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
TCS
2008
13 years 7 months ago
2008
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
ICTAC
2005
Springer
14 years 1 months ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...