Abstract
In this paper, we propose two new certificate-based signature (CBS) schemes with new features and advantages. The first one is very efficient as it does not require any pairing computation and its security can be proven using Discrete Logarithm assumption in the random oracle model. We also propose another scheme whose security can be proven in the standard model without random oracles. To the best of our knowledge, these are the first CBS schemes in the literature that have such kind of features.
Original language | English |
---|---|
Title of host publication | Information Security - 11th International Conference, ISC 2008, Proceedings |
Pages | 285-297 |
Number of pages | 13 |
DOIs | |
Publication status | Published - 28 Nov 2008 |
Externally published | Yes |
Event | Information Security Conference 2008 - Taipei, Taiwan Duration: 15 Sept 2008 → 18 Sept 2008 Conference number: 11th https://link.springer.com/book/10.1007/978-3-540-85886-7 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 5222 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Information Security Conference 2008 |
---|---|
Abbreviated title | ISC 2008 |
Country/Territory | Taiwan |
City | Taipei |
Period | 15/09/08 → 18/09/08 |
Internet address |
|