Sciweavers

239 search results - page 26 / 48
» Approaches to Formal Verification of Security Protocols
Sort
View
ACNS
2007
Springer
105views Cryptology» more  ACNS 2007»
16 years 10 days ago
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
Abstract. Untraceability and unreuseability are essential security properties for electronic cash protocols. Many protocols have been proposed to meet these two properties. However...
Zhengqin Luo, Xiaojuan Cai, Jun Pang, Yuxin Deng
SIGMETRICS
2008
ACM
130views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Using probabilistic model checking in systems biology
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
WWW
2004
ACM
16 years 6 months ago
Securing web application code by static analysis and runtime protection
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabil...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 10 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
HICSS
2005
IEEE
144views Biometrics» more  HICSS 2005»
15 years 11 months ago
Secure Dynamic Source Routing
— In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also prese...
Frank Kargl, Alfred Geiss, Stefan Schlott, Michael...