Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

12-2005

Abstract

The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where individual user may choose its working domain independently. In the second fold, we instantiate our generic construction with RSA so that the RSA moduli in our scheme can be chosen independently by individual user and thus the moduli is not required to be of the same length. Consequently, our proposed instantiation is the first scheme based on the RSA problem that works for any moduli – this is the most significant feature of our scheme different from the best results constructed from the RSA problem (say, Kawauchi et al’s scheme [14], and Lysyanskaya et al’s scheme [16]).

Keywords

Homomorphic trapdoor one-way permutation, Sequential aggregate signature, Signature scheme

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

Information and Communications Security: 7th International Conference, ICICS 2005, Beijing, China, December 10-13: Proceedings

Volume

3783

First Page

207

Last Page

219

ISBN

9783540320999

Identifier

10.1007/11602897_18

Publisher

Springer

City or Country

Berlin

Copyright Owner and License

Publisher

Additional URL

https://doi.org/10.1007/11602897_18

Download

Share

COinS