DocumentCode :
3076411
Title :
Efficient Certificate-Based and Randomized Signature from Pairings
Author :
Xiangjun, Xin ; Peixu, Xing
Author_Institution :
Dept. of Math. & Inf. Sci., Zhengzhou Univ. of Light Ind., Zhengzhou, China
Volume :
2
fYear :
2009
fDate :
10-11 July 2009
Firstpage :
222
Lastpage :
224
Abstract :
Most of pairing-based schemes need two or more operations of pairings. To find an efficient randomized certificate-based signature from pairings, by constructing a fraction such that a random element of the gap Diffie-Hellman group is included in the numerator and the sum of the master key and the output of the hash function is included in the denominator, a new signature scheme from pairings is proposed, in which only one operation of pairings is used. Under the hardness assumption of CDHP, the scheme can be proved to be secure in random oracle. The new signature is an efficient pairing-based one, since there is only one operation of pairings in it. The new randomized signature is short. On the other hand, the security proof has a tight reduction.
Keywords :
cryptography; digital signatures; CDHP; computational Diffie-Hellman problem; gap Diffie-Hellman group; hash function; pairing; random oracle; randomized certificate-based signature; security; Additives; Computer security; Digital signatures; Elliptic curve cryptography; Forgery; Information science; Mathematics; Polynomials; Public key; Public key cryptography; bilinear pairings; digital signature; security; signature;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Engineering, 2009. ICIE '09. WASE International Conference on
Conference_Location :
Taiyuan, Shanxi
Print_ISBN :
978-0-7695-3679-8
Type :
conf
DOI :
10.1109/ICIE.2009.93
Filename :
5211425
Link To Document :
بازگشت