2007 Australasian Telecommunication Networks and Applications Conference 2007
DOI: 10.1109/atnac.2007.4665307
|View full text |Cite
|
Sign up to set email alerts
|

An attack-resistant hashing scheme

Abstract: Malicious users can launch denial-of-service attacks to any hash-based application by enforcing continuous hash collisions. In this paper, we propose a generalized attack-resistant hashing algorithm that is immune to these attacks. Experimental results show that our secure hashing algorithms are efficient and robust against hash collision attacks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
(4 reference statements)
0
1
0
Order By: Relevance
“…In the non parameter CUSUM algorithm, the idea of sequential variation is proposed (Peng, Leckie, & Ramamohanarao, 2003. To implement that algorithm, one needs to create database containing large amount of legal IP address.…”
Section: Change Point Detection: Cusummentioning
confidence: 99%
“…In the non parameter CUSUM algorithm, the idea of sequential variation is proposed (Peng, Leckie, & Ramamohanarao, 2003. To implement that algorithm, one needs to create database containing large amount of legal IP address.…”
Section: Change Point Detection: Cusummentioning
confidence: 99%