DocumentCode
2191164
Title
An Efficient Multi Recipient Signcryption Scheme Offering Non Repudiation
Author
Ahmed, Fahad ; Masood, Asif ; Kausar, Firdous
Author_Institution
Inf. Security Dept., Coll. of Telecommun. Eng. (MCS), Rawalpindi, Pakistan
fYear
2010
fDate
June 29 2010-July 1 2010
Firstpage
1577
Lastpage
1581
Abstract
Signcryption was first proposed by Zheng and there after several signcryption schemes have been formulated. The broadcast scheme for Zheng does not offer non repudiation using public verification. A latest research by Elkamchouchi et. al proposed a new signcryption scheme for the broadcast environment. The scheme is known as Signcryption Multiple-Recipients Variant (SMRV). From the detail analysis of the scheme, it is observed that confidentiality of the information is lost when the parameters are sent to the third party for verification. Thus the scheme violates the basic property of security. Upon further analysis it is seen that the computational cost of the scheme can be reduced by eliminating few unnecessary steps which do not strengthen the security of the scheme but introduces an extra computational cost. In this paper an efficient and improved signcryption scheme for the broadcast environment is presented. The presented scheme is more efficient than Zheng´s and Elkamchouchi et. al scheme in terms of computational cost. The scheme offers non repudiation through public verification and confidentiality of the information is also ensured.
Keywords
cryptography; Elkamchouchi et. al scheme; Zheng et. al scheme; broadcast environment; efficient multirecipient signcryption scheme; public verification; security; signcryption multiple-recipient variant; Computational efficiency; Encryption; Equations; Mathematical model; Public key; Diffie-Hellman Problem; Discrete Logarithm Problem; Non-repudiation; Public verifiability; Signcryption;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location
Bradford
Print_ISBN
978-1-4244-7547-6
Type
conf
DOI
10.1109/CIT.2010.280
Filename
5577932
Link To Document