Self-certified signatures based on discrete logarithms

Abstract

In the trivial PKI, a digital signature provides the authenticity of a signed message with respect to a public key, while the authenticity of the public key with respect to a signer lies on a certificate provided by a certificate authority. To verify a signature, verifiers have to first verify the corresponding certificate. To avoid this burden, in this paper, we propose a self-certified signature scheme based on discrete logarithms to provide an implicit as well as mandatory verification of public keys. We show that this new scheme can achieve strong unforgeability in the random oracle model. © Springer-Verlag Berlin Heidelberg 2007.