Sciweavers

166 search results - page 24 / 34
» Formal analysis of secure contracting protocol for e-tenderi...
Sort
View
140
Voted
IFIP
2010
Springer
14 years 8 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
IJNSEC
2007
121views more  IJNSEC 2007»
15 years 1 months ago
Injecting Heterogeneity Through Protocol Randomization
In this paper, we argue that heterogeneity should be an important principle in design and use of cryptographic protocols. We use automated formal analysis tools to randomly genera...
Li Zhuang, J. D. Tygar, Rachna Dhamija
110
Voted
CSL
2010
Springer
15 years 3 months ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers
118
Voted
FSTTCS
2003
Springer
15 years 7 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
IFIP
2009
Springer
15 years 8 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi