A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings
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. Therefor...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/454393 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562489348325376 |
|---|---|
| author | Nai-Wei Lo Jia-Lun Tsai |
| author_facet | Nai-Wei Lo Jia-Lun Tsai |
| author_sort | Nai-Wei Lo |
| collection | DOAJ |
| description | 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 2010, Lin et al. 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). |
| format | Article |
| id | doaj-art-a0bb87c1efe84d74bbd32f194882b607 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-a0bb87c1efe84d74bbd32f194882b6072025-02-03T01:22:37ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/454393454393A Provably Secure Proxy Signcryption Scheme Using Bilinear PairingsNai-Wei Lo0Jia-Lun Tsai1Department of Information Management, National Taiwan University of Science and Technology, Taipei 106, TaiwanDepartment of Information Management, National Taiwan University of Science and Technology, Taipei 106, TaiwanAs 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 2010, Lin et al. 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).http://dx.doi.org/10.1155/2014/454393 |
| spellingShingle | Nai-Wei Lo Jia-Lun Tsai A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings Journal of Applied Mathematics |
| title | A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings |
| title_full | A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings |
| title_fullStr | A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings |
| title_full_unstemmed | A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings |
| title_short | A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings |
| title_sort | provably secure proxy signcryption scheme using bilinear pairings |
| url | http://dx.doi.org/10.1155/2014/454393 |
| work_keys_str_mv | AT naiweilo aprovablysecureproxysigncryptionschemeusingbilinearpairings AT jialuntsai aprovablysecureproxysigncryptionschemeusingbilinearpairings AT naiweilo provablysecureproxysigncryptionschemeusingbilinearpairings AT jialuntsai provablysecureproxysigncryptionschemeusingbilinearpairings |