Sciweavers

216 search results - page 18 / 44
» Models and Proofs of Protocol Security: A Progress Report
Sort
View
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
13 years 11 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
2009
ACM
14 years 2 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
ICDCS
2007
IEEE
14 years 1 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee
PODC
2003
ACM
14 years 17 days ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
CSFW
1999
IEEE
13 years 11 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