| 基于离散对数的门限解签密方案 |
| |
| 引用本文： | 殷凤梅,王筱薇倩,张江.基于离散对数的门限解签密方案[J].井冈山大学学报（自然科学版）,2016(4):43-45,62. |
| |
| 作者姓名： | 殷凤梅 王筱薇倩 张江 |
| |
| 作者单位： | 合肥师范学院公共计算机教学部, 安徽, 合肥 230601,合肥师范学院公共计算机教学部, 安徽, 合肥 230601,合肥师范学院公共计算机教学部, 安徽, 合肥 230601 |
| |
| 基金项目： | 国家自然科学青年科学基金项目（61503112）；安徽省高校优秀青年人才支持计划重点项目（gxyqZD2016231） |
| |
| 摘 要： | 为了降低门限解签密算法的计算开销,基于离散对数问题提出了一种新的门限解签密方案。该方案通过随机数和私钥生成签密密钥来签密消息,引入门限共享思想获取解签密钥来恢复消息。与现有方案相比,该方案的计算开销明显较小。在离散对数假设和DDH假设的前提下,该方案满足机密性、不可伪造性、不可否认性和不相关性。
|
| 关 键 词： | 签密 解签密 门限性 离散对数 |
| 收稿时间： | 2016/3/12 0:00:00 |
| 修稿时间： | 2016/4/18 0:00:00 |
A THRESHOLD UNSIGNCRYPTION SCHEME BASED ON DLP |
| |
| YIN Feng-mei,WANG Xiao-weiqian and ZHANG Jiang.A THRESHOLD UNSIGNCRYPTION SCHEME BASED ON DLP[J].Journal of Jinggangshan University(Natural Sciences Edition),2016(4):43-45,62. |
| |
| Authors: | YIN Feng-mei WANG Xiao-weiqian and ZHANG Jiang |
| |
| Institution: | Department of Public Computer Teaching, Hefei Normal University, Hefei, Anhui 230601, China,Department of Public Computer Teaching, Hefei Normal University, Hefei, Anhui 230601, China and Department of Public Computer Teaching, Hefei Normal University, Hefei, Anhui 230601, China |
| |
| Abstract: | In order to reduce the computational cost of the algorithm, a new threshold unsigncryption scheme based on DLP (discrete logarithm problem) is proposed. In the scheme, the key of the signcryption is generated by the random number and the private key to sign the message. Furthermore, the key of the unsigncryption is gained by introducing the threshold sharing to recover the message. Compared with the existing schemes, the computational cost of the proposed scheme is obviously smaller. On the premise of DLP assumption and DDH assumption, the scheme has been proved to satisfy confidentiality, unforgeability, non-repudiation and non-correlation. |
| |
| Keywords: | signcryption unsigncryption threshold DLP |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《井冈山大学学报（自然科学版）》浏览原始摘要信息 |
| 点击此处可从《井冈山大学学报（自然科学版）》下载免费的PDF全文 |
|
