An Efficient Randomized Verifiably Encrypted Signature Scheme
Li Gang · 2008
In the verifiably encrypted signature(VES) schemes from pairings,the pairing operations are the most time-consuming.So,in the schemes of such kind,the pairing operations should be less used.Based on a new construction of the signature scheme from pairings,a novel randomized and verifiably encrypted signature scheme is proposed,in which there is the least pairing operation.That is,there is only one pairing operation in the new scheme.Therefore,compared with the other randomized VES schemes from pairings,the new scheme is more efficient.The security of our scheme depends on the hardness assumption of k-CAAP(collusion attack algorithm with k traitors problem) and DLP(discrete logarithm problem).