Efficient certificateless multi-receiver anonymous signcryption scheme
To solve the private key escrow problem of identity-based multi-receiver signcryption schemes,the security model for multi-receiver signcryption scheme was constructed,and then a certificateless multi-receiver signcryption scheme based on ECC was proposed.Furthermore,the security of the scheme in th...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2016-06-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016122/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539559968473088 |
---|---|
author | Yan-lin QIN Xiao-ping WU Wei HU |
author_facet | Yan-lin QIN Xiao-ping WU Wei HU |
author_sort | Yan-lin QIN |
collection | DOAJ |
description | To solve the private key escrow problem of identity-based multi-receiver signcryption schemes,the security model for multi-receiver signcryption scheme was constructed,and then a certificateless multi-receiver signcryption scheme based on ECC was proposed.Furthermore,the security of the scheme in the random oracle was based on the computational Diffie-Hellman assumption and elliptic curve discrete logarithm assumption was proved.Meanwhile,the scheme was free from certificate management center and needed no bilinear paring operation in both signcryption and decryption phases.It can also protect both the sender and receivers’identity from leaking out.So the scheme can be applied conveniently to broadcast signcryption in network environment. |
format | Article |
id | doaj-art-1f741e86b5904a1cb4c118235f2b8a50 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2016-06-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-1f741e86b5904a1cb4c118235f2b8a502025-01-14T06:55:37ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2016-06-013712913659701738Efficient certificateless multi-receiver anonymous signcryption schemeYan-lin QINXiao-ping WUWei HUTo solve the private key escrow problem of identity-based multi-receiver signcryption schemes,the security model for multi-receiver signcryption scheme was constructed,and then a certificateless multi-receiver signcryption scheme based on ECC was proposed.Furthermore,the security of the scheme in the random oracle was based on the computational Diffie-Hellman assumption and elliptic curve discrete logarithm assumption was proved.Meanwhile,the scheme was free from certificate management center and needed no bilinear paring operation in both signcryption and decryption phases.It can also protect both the sender and receivers’identity from leaking out.So the scheme can be applied conveniently to broadcast signcryption in network environment.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016122/certificateless cryptographymulti-receiver anonymous signcryptioncomputational Diffie-Hellman problemelliptic curve discrete logarithm problemrandom oracle |
spellingShingle | Yan-lin QIN Xiao-ping WU Wei HU Efficient certificateless multi-receiver anonymous signcryption scheme Tongxin xuebao certificateless cryptography multi-receiver anonymous signcryption computational Diffie-Hellman problem elliptic curve discrete logarithm problem random oracle |
title | Efficient certificateless multi-receiver anonymous signcryption scheme |
title_full | Efficient certificateless multi-receiver anonymous signcryption scheme |
title_fullStr | Efficient certificateless multi-receiver anonymous signcryption scheme |
title_full_unstemmed | Efficient certificateless multi-receiver anonymous signcryption scheme |
title_short | Efficient certificateless multi-receiver anonymous signcryption scheme |
title_sort | efficient certificateless multi receiver anonymous signcryption scheme |
topic | certificateless cryptography multi-receiver anonymous signcryption computational Diffie-Hellman problem elliptic curve discrete logarithm problem random oracle |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016122/ |
work_keys_str_mv | AT yanlinqin efficientcertificatelessmultireceiveranonymoussigncryptionscheme AT xiaopingwu efficientcertificatelessmultireceiveranonymoussigncryptionscheme AT weihu efficientcertificatelessmultireceiveranonymoussigncryptionscheme |