An integrated approach to cryptographic mitigation of denial-of-service attacks
Rangasamy, Jothi, Stebila, Douglas, Boyd, Colin, & Gonzalez Nieto, Juan M. (2011) An integrated approach to cryptographic mitigation of denial-of-service attacks. In Sandhu, Ravi & Wong, Duncan S. (Eds.) Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS) 2011, ACM, HKU SPACE Admiralty Learning Center, Hong Kong, pp. 114-123.
Gradual authentication is a principle proposed by Meadows as a way to tackle denial-of-service attacks on network protocols by gradually increasing the confidence in clients before the server commits resources. In this paper, we propose an efficient method that allows a defending server to authenticate its clients gradually with the help of some fast-to-verify measures. Our method integrates hash-based client puzzles along with a special class of digital signatures supporting fast verification. Our hash-based client puzzle provides finer granularity of difficulty and is proven secure in the puzzle difficulty model of Chen et al. (2009). We integrate this with the fast-verification digital signature scheme proposed by Bernstein (2000, 2008). These schemes can be up to 20 times faster for client authentication compared to RSA-based schemes. Our experimental results show that, in the Secure Sockets Layer (SSL) protocol, fast verification digital signatures can provide a 7% increase in connections per second compared to RSA signatures, and our integration of client puzzles with client authentication imposes no performance penalty on the server since puzzle verification is a part of signature verification.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Conference Paper|
|Keywords:||denial of service, client puzzles, Berstein's signatures, Secure Sockets Layer (SSL)|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DATA FORMAT (080400) > Data Encryption (080402)|
Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DISTRIBUTED COMPUTING (080500) > Networking and Communications (080503)
|Divisions:||Past > Schools > Computer Science|
Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Institutes > Information Security Institute
|Copyright Owner:||Copyright 2011 ACM|
|Copyright Statement:||Copyright ACM, 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS) 2011, http://doi.acm.org/10.1145/1966913.1966929|
|Deposited On:||15 Apr 2011 12:33|
|Last Modified:||22 Jun 2011 05:21|
Repository Staff Only: item control page