Towards a security model for computational puzzle schemes

Tang, Qiang and Jeckmans, Arjan (2011) Towards a security model for computational puzzle schemes. International Journal of Computer Mathematics, 88 (11). pp. 2246-2257. ISSN 0020-7160

PDF
Restricted to UT campus only: Request a copy
261Kb

Abstract:	In the literature, computational puzzle schemes have been considered as a useful tool for a number of applications, such as constructing timed cryptography, fighting junk emails, and protecting critical infrastructure from denial-of-service attacks. However, there is a lack of a general security model for studying these schemes. In this paper, we propose such a security model and formally define two properties, namely the determinable difficulty property and the parallel computation resistance property. Furthermore, we prove that a variant of the RSW scheme, proposed by Rivest, Shamir, andWagner, achieves both properties.
Item Type:	Article
Copyright:	© 2011 Taylor & Francis
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Distributed and Embedded Systems (DIES)
Link to this item:	http://purl.utwente.nl/publications/79937
Official URL:	http://dx.doi.org/10.1080/00207160.2010.543951
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page