Abstract
In this paper, we propose a new notion called Certificate-Based Sequential Aggregate Signature. Certificate-based cryptography proposed by Gentry [8] combines the merit of traditional public key cryptography and identity based cryptography, without use of the costly certificate chain verification process and the removal of key escrow security concern. Under this paradigm, we propose a first sequential aggregate signature. An aggregate signature scheme produces a short string that convinces any verifier that there are n messages signed by n parties, all of which may be distinct. The length of the string is a constant which is independent of n. Its compactness makes it particularly suitable to be employed in those environments where communication bandwidth is very limited, such as wireless network scenarios (e.g. MANETS, cellular networks, sensor networks, satellite communication). We provide a concrete construction of this new notion and prove its security in the random oracle model.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2nd ACM Conference on Wireless Network Security, WiSec'09 |
Pages | 21-28 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |
Event | 2nd ACM Conference on Wireless Network Security, WiSec'09 - Zurich, Switzerland Duration: 16 Mar 2009 → 18 Mar 2009 |
Conference
Conference | 2nd ACM Conference on Wireless Network Security, WiSec'09 |
---|---|
Country/Territory | Switzerland |
City | Zurich |
Period | 16/03/09 → 18/03/09 |
Keywords
- Cryptography
- Digital signature