Sciweavers

127 search results - page 11 / 26
» Proving Properties of Security Protocols by Induction
Sort
View
ASIACRYPT
2010
Springer
14 years 7 months ago
Optimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
Alon Rosen, Abhi Shelat
ISECS
2008
IEEE
15 years 4 months ago
Attacks on Two Buyer-Seller Watermarking Protocols and an Improvement for Revocable Anonymity
Buyer-seller watermarking protocols incorporate digital watermarking with cryptography, in order to protect digital copyrights and privacy rights for the seller and the buyer befo...
Mina Deng, Bart Preneel
85
Voted
ESORICS
2009
Springer
15 years 10 months ago
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
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...
Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
CSFW
2000
IEEE
15 years 1 months ago
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
James Heather, Steve Schneider
CSFW
1999
IEEE
15 years 1 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song