Cryptology ePrint Archive: Report 2014/590

Automated algebraic analysis of structure-preserving signature schemes

Joeri de Ruiter

Abstract: Structure-preserving signature schemes can be very useful in the construction of new cryptographic operations like blind signatures. Recently several of these schemes have been proposed. The security of signature-preserving signature schemes is still proved by hand, which can be a laborious task. One of the ways to prove security of these schemes algebraic analysis can be used. We present an approach to perform this analysis and the first tool, CheckSPS, that can do an algebraic security analysis of these schemes, using SMT solvers as backend. This can help in constructing new schemes and analyse existing schemes. Our tool can handle all the common security objectives for signature schemes, i.e. existential unforgeability and strong existential unforgeability, and all the common capabilities for adversaries, i.e. random message attacks, non-adaptive chosen message attacks and adaptive chosen message attacks. The tool is sound, so if an attack is found it is actually possible to construct a forged signature.

Category / Keywords: applications / structure-preserving signature schemes, automated analysis, algebraic analysis

Date: received 30 Jul 2014

Contact author: joeri at cs ru nl

Available format(s): PDF | BibTeX Citation

Version: 20140731:092504 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]