Choo (2007) A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model

Post a Comment

CONTRIBUTORS:

Author:

Choo, Kim-Kwang Raymond (Australian Institute of Criminology)

JOURNAL:

The Computer Journal, 50(5), 591 - 601.

YEAR:

2007

PUB TYPE:

Journal Article

SUBJECT(S):

None

DISCIPLINE:

Computer Science

HTTP:

http://comjnl.oxfordjournals.org/

LANGUAGE:

English

PUB ID:

103-433-970 (Last edited on 2007/10/07 01:11:46 GMT-6)

SPONSOR(S):

ABSTRACT:
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer security community (using automated proof tools), a simplified version of the protocol is only recently proven secure by Backes and Pfitzmann (2006) in their cryptographic library framework. We present a protocol for key establishment that is closely based on the Yahalom protocol. We then present a security proof in the Bellare and Rogaway (1993) model and the random oracle model. We also observe that no partnering mechanism is specified within the Yahalom protocol. We then present a brief discussion on the role and the possible construct of session identifiers as a form of partnering mechanism, which allows the right session key to be identified in concurrent protocol executions. We then recommend that session identifiers should be included within protocol specification rather than consider session identifiers as artefacts in protocol proof.

STATISTICS

Click on # to view
Citations		2
References		0
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		2/190

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next