期刊文献+

一个高效的可验证加密签名方案 被引量:1

An Efficient Verifiably Encrypted Signature Scheme
在线阅读 下载PDF
导出
摘要 基于Square Computational Diffie-Hellman困难假设,构造了一个新型签名方案,在随机预言机模型下对其进行了安全性证明。基于该签名,设计出一个高效、盲化的可验证加密签名方案,方案满足不可伪造性、不透明性要求。与已有可验证加密签名方案相比,该方案计算代价小,一共仅需2次对运算和5次群上标量乘运算,且签名长度仅有320bit,所以非常适用于带宽受限的环境。 In order to design a secure and efficient verifiably encrypted signature scheme,we first proposed a new digital signature scheme under the Square Computational Diffie-Hellman assumption.The scheme is probably secure in the random oracle model.And then,based on the proposed signature scheme,a blind verifiably encrypted signature(BVES) scheme was presented in this paper.The BVES scheme enjoys desirable properties of unforgeability and opacity.Compared with existing VES schemes,our scheme’s computational cost is lower and the whole operation only requires two pairing evaluations and five scalar multiplications.The size of the signature generated by our BVES is only 320 bits.So it can be used in environments with stringent bandwidth constraints.
出处 《咸阳师范学院学报》 2010年第2期45-48,共4页 Journal of Xianyang Normal University
基金 国家自然科学基金项目(60903200) 陕西铁路工程职业技术学院重点项目(2009-32) 宝鸡文理学院重点项目(ZK0788)
关键词 数字签名 可验证加密签名 双线性映射 digital signatures verifiably encrypted signature bilinear maps
  • 相关文献

参考文献8

  • 1Asokan N, Shoup V, Waidner M. Optimistic fair exchange of digital signature (extended abstmct)[C]//In:Advanees in Cryptology-Eurocrypt' 98.LNCS 1403,Springer-Verlag, 1998: 591-606.
  • 2Boneh D, Gentry C, Lynn B, et al. Aggregate and verifiably encrypted signatures from Bilinear Maps [C]//In Proceedings of the Advances in Cryptology- EUROCRYPT 2003, LNCS 2656, 2003 : 416-432.
  • 3Gu Chunxiang, Zhu Yuefei. An ID-based verifiable encrypted signature scheme based on Hess, s scheme [C]//In: Proceedings of the 1st SKLOIS Conference on Information Security and Cryptology. Lecture Notes in Computer Science: 3822, Springer-Vedag, 2005 : 42-52.
  • 4Zhang Jianhong, Zou Wei. A robust verifiably encrypted signature scheme [C]//IFIP International Federation for information Processing 2006. LNCS 4097, 2006: 731-740.
  • 5齐亚平,都丽华.基于身份的签名和可验证加密签名方案[J].计算机应用研究,2008,25(5):1527-1529. 被引量:3
  • 6Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing [C]//In Advances in Cryptology-Asiacrypt 2001, LNCS 2248, Springer-Verlag, 2001 : 514-532.
  • 7Hess F. Efficient identity based signature schemes based on pairings [C]//In proceedings of the 9th Annual International Workshop on Selected Areas in Cryptography.Lecture Notes in Computer Science: 2595, Springer-Verlag, 2003:310-324.
  • 8张振峰.基于身份的可验证加密签名协议的安全性分析[J].计算机学报,2006,29(9):1688-1693. 被引量:8

二级参考文献24

  • 1Asokan N. , Shoup V. , Waidner M.. Optimistic fair exchange of digital signatures. In: Proceedings of the Advances in Cryptology- EUROCRYPT' 98. Lecture Notes in Computer Science: 1403. Springer-Verlag, 1998, 591-606
  • 2Asokan N. , Shoup V. , Waidner M.. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communication, 2000, 18(4): 593-610
  • 3Bao F. , Deng R. H. , Mao W.. Efficient and practical fair exchange protocols with off-line TTP. In: Proceedings of the IEEE Symposium on Security and Privacy, 1998, 77-85
  • 4Ateniese G.. Verifiable encryption of digital signatures and applications. ACM Transactions on Information and System Security, 2004, 7(1): 1-20
  • 5Camenisch J. , Damgard I. B.. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In- Proceedings of the Advances in Cryptology-ASIACRYPT 2000. Lecture Notes in Computer Science: 1976. Springer-Verlag, 2000, 331-345
  • 6Boneh D. , Gentry C. , Lynn B. , Shacham H.. Aggregate and verifiably encrypted signatures from bilinear maps. In: Proceedings of the Advances in Cryptology-EUROCRYPT'03.Lecture Notes in Computer Science: 2656. Springer-Verlag,2003, 416-432
  • 7Dodis Y. , Reyzin L.. Breaking and repairing optimistic fair exchange from PODC 2003. In: Proceedings of the ACM Workshop on Digital Rights Management, ACM, 2003, 47-54
  • 8Bao F.. Colluding attacks to a payment protocol and two signature exchange schemes. In: Proceedings of the Advances in Cryptology-ASIACRYPT 2004. Lecture Notes in Computer Science: 3329. Springer-Verlag, 2004, 417-429
  • 9Bellare M. , Rogaway P.. Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st Annual Conference on Computer and Communications Security, ACM, 1993, 62-73
  • 10Shamir A.. Identity based cryptosystems and signature schemes. In: Proceedings of the Advances in Cryptology-Crypto' 84. Lecture Notes in Computer Science: 196. Springer-Verlag, 1984, 47-53

共引文献9

同被引文献12

  • 1张振峰.基于身份的可验证加密签名协议的安全性分析[J].计算机学报,2006,29(9):1688-1693. 被引量:8
  • 2AL-RIYAMI' S S, PATERSON K G. Certificateless public key cryp- tography [ C]// ASIANCRYPT 2003: Proceedings of Cryptology, LNCS 2894. Berlin: Spinger-Verlag, 2003:452-473.
  • 3GORANTLA M C, SAXENA A. An efficient certificateless signature scheme [ C]// Proceedings of the 2005 Computational Intelligence and Security, LNCS 3802. Berlin: Springer-Verlag, 2005: 110- 116.
  • 4RIVEST R L, SHAMIR A, ADLEMAN L. A method for obtaining digital signatures and public-key eryptosystems J]. Communica-tions of the ACM, 1978, 21(2): 120 -126.
  • 5BONEH D, GENTRY C, LYNN B, et al. Aggregate and verifiably encrypted signatures from bilinear maps [ C]//EUROCRYPT 2003: Proceedings of the Advances in Cryptology, LNCS 2656. Berlin: Springer-Vedag, 2003:416-432.
  • 6HESS F. Efficient identity based signature schemes based on pairing [ C]//Proceedings of the 9th Annual International Workshop on Se- lected Areas in Cryptography, LNCS 2595. Berlin: Springer-Ver- lag, 2003:310-324.
  • 7GU C X, ZHU Y F. An ID-based verifiable encrypted signature scheme based on Hess's scheme [ C]// Proceedings of the 1st SK- LOIS Conference on Information Security and Cryptology, LNCS 3822. Berlin: Springer-Verlag, 2005:42 -52.
  • 8ASOKAN N, SHOUP V, WAIDNER M. Optimistic fair exchange of digital signature (extended abstract) [ C]//EUROCRYFI'98: Pro- ceedings of the 1988 International Conference on the Theory and Ap- plication of Cryptographie Techniques, LNCS 1403. Ber/in: Spring- er-Verlag, 1988:591-606.
  • 9CASTRO R, DAHAB R. Two notes on the security of eertifieateless signature [ C]// Proceedings of Provable Security, LNCS 4784. Berlin: Springer-Verlag, 2007:85-102.
  • 10SHIM K-A. An ID-based aggregate signature scheme with constant pairing computations [ J]. Journal of Systems and Software, 2010, 83(10) : 1873 - 1880.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部