285 search results - page 13 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
TCC
2007
Springer
15 years 5 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...
105
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
106
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
114
click to vote
LICS
2007
IEEE
15 years 6 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...