CHOO, BOYD and HITCHCOCK (2005) Errors in Computational Complexity Proofs for Protocols

getCITED

Home Search Add Content Reports Help

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

Add to Bookstack | Show Bookstack | Change Bookstack

Errors in Computational Complexity Proofs for Protocols

Post a Comment

CONTRIBUTORS:

	Author:	CHOO, KIM-KWANG RAYMOND (Australian Institute of Criminology)
	Author:	BOYD, COLIN
	Author:	HITCHCOCK, YVONNE
	Editor:	Bimal Roy

PROCEEDINGS TITLE:

Advances in Cryptology - Asiacrypt 2005 ( Volume 3788/2005 of Lecture Notes in Computer Science)

YEAR:

2005

PUB TYPE:

Conference Paper in Proceedings

PAGES:

624 - 643

SUBJECT(S):

None

DISCIPLINE:

Computer Science

HTTP:

http://dx.doi.org/10.1007/11593447_32

LANGUAGE:

English

PUB ID:

103-429-550 (Last edited on 2006/08/24 17:54:57 GMT-6)

SPONSOR(S):

ABSTRACT:
Proofs are invaluable tools in assuring protocol implementers about the security properties of protocols. However, several instances of undetected flaws in the proofs of protocols (resulting in flawed protocols) undermine the credibility of provably-secure protocols. In this work, we examine several protocols with claimed proofs of security by Boyd & Gonzalez Nieto (2003), Jakobsson & Pointcheval (2001), and Wong & Chan (2001), and an authenticator by Bellare, Canetti, & Krawczyk (1998). Using these protocols as case studies, we reveal previously unpublished flaws in these protocols and their proofs. We hope our analysis will enable similar mistakes to be avoided in the future.

STATISTICS

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

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