Sciweavers

401 search results - page 25 / 81
» Formal Analysis of Meeting Protocols
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 11 months ago
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has b...
Pieter Ceelen, Sjouke Mauw, Sasa Radomirovic
CSFW
2005
IEEE
14 years 4 months ago
Compositional Analysis of Contract Signing Protocols
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
TPDS
1998
71views more  TPDS 1998»
13 years 10 months ago
Theoretical Analysis for Communication-Induced Checkpointing Protocols with Rollback-Dependency Trackability
—Rollback-Dependency Trackability (RDT) is a property that states that all rollback dependencies between local checkpoints are on-line trackable by using a transitive dependency ...
Jichiang Tsai, Sy-Yen Kuo, Yi-Min Wang
IPL
2010
93views more  IPL 2010»
13 years 9 months ago
Compiling and securing cryptographic protocols
Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequence...
Yannick Chevalier, Michaël Rusinowitch
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
14 years 4 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya