A provably secure proxy signcryption scheme using bilinear pairings

DOI10.1155/2014/454393MaRDI QIDQ2336432zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jia-Lun Tsai, Nai-wei Lo

Publication date 19 November 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/454393

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

Summary: As people in modern societies are busier than any human era and computer network has profound impact on how people work and live through fast and convenient information exchange, people need more help from each other to accomplish more work via network connections in limited period of time. Therefore, privilege delegation mechanism has become a necessary service in modern enterprises and organizations. Proxy signcryption scheme provides a secure privilege delegation mechanism for a person to delegate his privilege to his proxy agent to accomplish things. In [\textit{H.-Y. Lin} et al., Comput. Math. Appl. 60, No. 7, 1850--1858 (2010; Zbl 1205.68150)] had proposed an efficient signcryption scheme using bilinear pairings. However, we found that the proxy signcryption scheme of Lin et al. is vulnerable to the chosen warrant attack. A provably secure proxy signcryption scheme using bilinear pairings is introduced accordingly. In terms of performance efficiency, the proposed scheme is superior to other existing schemes. In addition, a new security model is proposed to describe proxy signcryption scheme; based on the security model we show that the proposed scheme is provably secure in terms of indistinguishability under adaptive chosen ciphertext attack (IND-CCA2), unforgeability under adaptive chosen message attack (EF-CMA), and unforgeability under adaptive chosen warrant attack (EF-CWA).

Recommendations

• Cryptology and Network Security
• Efficient proxy signcryption scheme with provable CCA and CMA security
• ID-based threshold proxy signcryption scheme from bilinear pairings
• Cryptology and Network Security
• A provably secure proxy signature scheme in certificateless cryptography

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of efficient proxy signature schemes for mobile communication
• Designing efficient proxy signature schemes for mobile communication
• Efficient and Provably Secure Multi-receiver Identity-Based Signcryption
• Efficient proxy signcryption scheme with provable CCA and CMA security
• Hierarchical ID-Based Cryptography
• scientific article; zbMATH DE number 1186868 (Why is no real title available?)
• scientific article; zbMATH DE number 1304303 (Why is no real title available?)
• scientific article; zbMATH DE number 1088233 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1487950 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• ID-Based Blind Signature and Ring Signature from Pairings
• New directions in cryptography
• Selected Areas in Cryptography

Cited in

(6)

• A secure anonymous proxy signcryption scheme
• Cryptology and Network Security
• Cryptology and Network Security
• Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
• Efficient proxy signcryption scheme with provable CCA and CMA security
• A new threshold proxy signature scheme from bilinear pairings

This page was built for publication: A provably secure proxy signcryption scheme using bilinear pairings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336432)