Sciweavers

297 search results - page 29 / 60
» Formal Analysis of a Non-Repudiation Protocol
Sort
View
JCS
2006
157views more  JCS 2006»
13 years 7 months ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 11 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
CCS
2008
ACM
13 years 9 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
WWW
2007
ACM
14 years 8 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...