Certificateless Proxy Signature from RSA
Author(s) -
Lunzhi Deng,
Jiwen Zeng,
Yunyun Qu
Publication year - 2014
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2014/373690
Subject(s) - proxy (statistics) , cryptosystem , computer science , bilinear interpolation , computer security , adversary , computation , sign (mathematics) , signature (topology) , theoretical computer science , cryptography , mathematics , algorithm , machine learning , computer vision , mathematical analysis , geometry
Although some good results were achieved in speeding up the computation of pairing function in recent years, it is still interesting to design efficient cryptosystems with less bilinear pairing operation. A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer within a given context. We propose a certificateless proxy signature (CLPS) scheme from RSA and prove its security under the strongest security model where the Type I/II adversary is a super Type I/II adversary.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom