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.
In addition, Li et REF presented two CBS schemes, namely, a CBS scheme without pair operation in the random oracle model and a CBS scheme under the standard model (without using random oracles).
Certificate-Based Signature Schemes without Pairings or Random Oracles
IACR Cryptology ePrint Archive
IACR Cryptology ePrint Archive
Computer Science