We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
— In this paper, we propose a new pairing-based proxy signature. Most remarkable point in our proposal is that our scheme realizes short signature. More concretely, the explicit ...
A nominative signature scheme allows a nominator (i.e. the signer) and a nominee (i.e. a designated verifier) to jointly generate and publish a signature so that only the nominee ...
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...