26 search results - page 2 / 6 » Equational Cryptographic Reasoning in the Maude-NRL Protocol... |
IANDC
2008
13 years 7 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
RTA
2005
Springer
14 years 26 days ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
FOSSACS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...