285 search results - page 6 / 57 » Computationally Sound, Automated Proofs for Security Protoco... |
ESORICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our ...
ENTCS
2006
13 years 7 months ago
2006
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
ASIAN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this...