Complementing Computational Protocol Analysis with Formal Specifications
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
PROCEEDINGS TITLE:
|
|
|
YEAR:
|
2004
|
|
PUB TYPE:
|
Conference Paper in Proceedings
|
|
PAGES:
|
129 -
144
|
|
SUBJECT(S):
|
None
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-429-558
(Last edited on
2006/08/24 18:22:15 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversary and the protocol entities. This allows a matching model to be used in both a machine-generated analysis and a human-generated computational proof. Using a protocol of Jakobsson and Pointcheval as a case study, it is demonstrated that flaws in the protocol could have been found with this approach, providing evidence that the combination of human and computer analysis can be more effective than either alone. As well as finding the known flaw, previously unknown flaws in the protocol are discovered by the automatic analysis.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
1
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
2/249
|
|
|
|
|
|
|
| Prev |
Next |
|