Sciweavers

119 search results - page 12 / 24
» Formal Methods for Assuring Security of 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
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
14 years 3 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
CCS
2005
ACM
14 years 4 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
HASE
2008
IEEE
14 years 5 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
CCS
2005
ACM
14 years 4 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet