|
|||||
|
|
| IND-CCA2完全匿名的高效短群签名方案* | |
| 引用本文： | 马海英,王占君,王周秀b.IND-CCA2完全匿名的高效短群签名方案*[J].计算机应用研究,2009,26(5):1922-1925. |
| 作者姓名： | 马海英 王占君 王周秀b |
| 作者单位： | 1. 南通大学,计算机科学与技术学院,江苏,南通,226019 2. 南通大学,理学院,江苏,南通,226007 3. 南通大学,教育科学学院,江苏,南通,226007 |
| 基金项目： | 南通大学引进人才科研启动基金资助项目（03080053;03080043;03080052） |
| 摘 要： | 基于DDH、TCRv、KEA3假设下的改进Cramer-Shoup加密方案和SDH假设，提出一种新的SDH问题的零知识证明协议，并基于此协议构造了一种在BMW模型下可证明安全的短群签名方案，该方案具有IND-CCA2完全匿名性,签名长度仅为1 193 bit。与最近其他方案相比，该方案以强假设为代价提高系统的效率并缩短签名长度。 |
| 关 键 词： | 短群签名 完全匿名性 改进的Cramer-Shoup加密 IND-CCA2安全 |
Efficient short group signature with IND-CCA2 full-anonymity |
|
| MA Hai-ying,WANG Zhan-jun,WANG Zhou-xiub.Efficient short group signature with IND-CCA2 full-anonymity[J].Application Research of Computers,2009,26(5):1922-1925. | |
| Authors: | MA Hai-ying WANG Zhan-jun WANG Zhou-xiub |
| Affiliation: | (1. College of Computer Science, Nantong University, Nantong Jiangsu 226019, China; 2.a. School of Science, b. School of Education, Nantong University, Nantong Jiangsu 226007, China) |
| Abstract: | Abstract:This paper presented a new zero-knowledge protocol for SDH, which was based on improved Cramer-Shoup encryption from DDH, TCRv, KEA3 assumption and SDH assumption. Using this protocol as a building block, constructed a new short group signature, which was provable secure in the BMW model, the scheme was of IND-CCA2-full-anonymity, and the signature was only 1 193 bit in size. Compared with other related works, this method was of higher efficiency and shorter size of group signature at the cost of strong assumptions. |
| Keywords: | short group signature full-anonymity improved Cramer-Shoup encryption IND-CCA2 secure |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 | |
| 点击此处可从《计算机应用研究》下载全文 | |