%0 Journal Article %1 noauthororeditor %A 1, Hassan M. Elkamchouchi %A Elkhair2, Eman F. Abu %A and Yasmine Abouelseoud3, %D 2013 %J International Journal of Information Technology, Modeling and Computing (IJITMC) %K (DLP) (ECDLP) Curve Discrete Elliptic Logarithm Problem Proxy Requirements. Security Signcryption %N 2 %P 01-13 %R 10.5121/ijitmc.2013.1202 %T AN EFFICIENT PROXY SIGNCRYPTION SCHEME BASED ON THE DISCRETE LOGARITHM PROBLEM %U http://airccse.org/journal/ijitmc/papers/1213ijitmc02.pdf %V 1 %X Signcryption is a cryptographic primitive which simultaneously provides both confidentiality and authenticity in a single logical step. In a proxy signature scheme, an original signer delegates his signing power to a proxy agent, who signs a message on behalf of him. This paper introduces a new proxy signcryption scheme based on the Discrete Logarithm Problem (DLP) with a reduced computational complexity compared to other schemes in literature. In this proposed scheme, the receiver is the only one who can verify the origin of the ciphertext. Moreover, in this scheme, an authorized proxy signcrypter can create valid proxy signatures after verifying the identity of the original signcrypter. The proposed scheme achieves the various desirable security requirements. An elliptic curve based version of the proposed proxy signcryption scheme has been implemented using Mathematica for realistic (256-bit) parameters to emphasize the ease of its practical use

@article{noauthororeditor, abstract = {Signcryption is a cryptographic primitive which simultaneously provides both confidentiality and authenticity in a single logical step. In a proxy signature scheme, an original signer delegates his signing power to a proxy agent, who signs a message on behalf of him. This paper introduces a new proxy signcryption scheme based on the Discrete Logarithm Problem (DLP) with a reduced computational complexity compared to other schemes in literature. In this proposed scheme, the receiver is the only one who can verify the origin of the ciphertext. Moreover, in this scheme, an authorized proxy signcrypter can create valid proxy signatures after verifying the identity of the original signcrypter. The proposed scheme achieves the various desirable security requirements. An elliptic curve based version of the proposed proxy signcryption scheme has been implemented using Mathematica for realistic (256-bit) parameters to emphasize the ease of its practical use}, added-at = {2018-09-25T06:54:53.000+0200}, author = {1, Hassan M. Elkamchouchi and Elkhair2, Eman F. Abu and and Yasmine Abouelseoud3}, biburl = {https://www.bibsonomy.org/bibtex/26b7c6e1031bfcbbd164360c0d2896648/alexafedrica}, doi = {10.5121/ijitmc.2013.1202}, interhash = {f63e754cdee3dd69be0c402e51807c08}, intrahash = {6b7c6e1031bfcbbd164360c0d2896648}, journal = {International Journal of Information Technology, Modeling and Computing (IJITMC)}, keywords = {(DLP) (ECDLP) Curve Discrete Elliptic Logarithm Problem Proxy Requirements. Security Signcryption}, month = may, number = 2, pages = {01-13}, timestamp = {2018-09-25T06:54:53.000+0200}, title = {AN EFFICIENT PROXY SIGNCRYPTION SCHEME BASED ON THE DISCRETE LOGARITHM PROBLEM }, url = {http://airccse.org/journal/ijitmc/papers/1213ijitmc02.pdf}, volume = 1, year = 2013 }