Compact sequential aggregate signatures
RIS ID
22491
Abstract
In this paper, a new notion which we call compact sequential aggregate signatures is introduced and formalized. Informally, a compact sequential aggregate signature states the following thing: for a given message vector m=(m1, · · · mι), a public key vector PK=(PK1, · · · , PKι) and a path p=(v1, · · · , vι), where vi=(idi, PKi), the size of the third component σ in a sequential aggregate signature (m, p, σ) is independent of the path length ι We propose a novel implementation of RSA-based regular signature scheme that works in an extended domain, and then transform it into a compact sequential aggregate signature scheme that works in a common domain such that the size of overflow bits is independent of the path length ι Finally, we show that our implementation is provably secure in the random oracle model assuming that the RSA problem is hard.
Publication Details
Mu, Y., Susilo, W. & Zhu, H. (2007). Compact sequential aggregate signatures. In Y. Cho, R. L. Wainwright, H. M. Haddad, S. Y. Shin & Y. Wan Koo (Eds.), ACM Symposium on Applied Computing (pp. 249-253). New York, NY, USA: ACM.