Towards a security model for computational puzzle schemes

Qiang Tang, Arjan Jeckmans

    Research output: Contribution to journalArticleAcademicpeer-review

    25 Downloads (Pure)


    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.
    Original languageUndefined
    Pages (from-to)2246-2257
    Number of pages12
    JournalInternational journal of computer mathematics
    Issue number11
    Publication statusPublished - 26 Apr 2011


    • EWI-21651
    • SCS-Cybersecurity
    • parallelization
    • IR-79937
    • Computational puzzle
    • METIS-286292
    • determinable difficulty

    Cite this