Comparing the Pre- and Post-specified Peer Models for Key Agreement
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
PROCEEDINGS TITLE:
|
|
|
YEAR:
|
2008
|
|
PUB TYPE:
|
Conference Paper in Proceedings
|
|
PAGES:
|
53 -
68
|
|
SUBJECT(S):
|
None
|
|
DISCIPLINE:
|
Computer Science
|
|
HTTP:
|
|
|
LANGUAGE:
|
English
|
|
PUB ID:
|
103-443-725
(Last edited on
2008/06/29 17:02:46 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this paper we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in
the pre- and post-specified peer models. We give examples of protocols that are secure in one model but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and
post-specified peer models.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
2/66
|
|
|
|
|
|
|
| Prev |
Next |
|