TY - GEN
T1 - An efficient multi recipient signcryption scheme offering non repudiation
AU - Ahmed, Fahad
AU - Masood, Asif
AU - Kausar, Firdous
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Diffie-hellman problem
KW - Discrete logarithm problem
KW - Non-repudiation
KW - Public verifiability
KW - Signcryption
UR - http://www.scopus.com/inward/record.url?scp=78249278138&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78249278138&partnerID=8YFLogxK
U2 - 10.1109/CIT.2010.280
DO - 10.1109/CIT.2010.280
M3 - Conference contribution
AN - SCOPUS:78249278138
SN - 9780769541082
T3 - Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010
SP - 1577
EP - 1581
BT - Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010
T2 - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010
Y2 - 29 June 2010 through 1 July 2010
ER -