期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

签密的仲裁安全与仲裁安全的签密方案 被引量：2

Arbitral Security of Signcryptions and a Securely Arbitral Signcryption Scheme
在线阅读 下载PDF
导出
摘要 签密能高效地同时完成数据加密与认证,可用于设计紧凑的安全通信协议.签密中的仲裁机制用于保护签密的不可抵赖性,但同时用于仲裁的信息可能危及协议安全.本文指出签密仲裁中存在仲裁者解密攻击和仲裁机制无法保护明文完整性两种安全隐患,归纳其原因并指出解决方法.提出一个可安全仲裁的安全混合签密方案SASC,并在随机预言机模型下证明SASC方案具有IND-CCA2和UF-CMA安全性;SASC基于明文仲裁,不仅能维护明完整性而且能抵抗仲裁者解密攻击.SASC方案不增加计算量和通信量,且对明文的长度没有限制. Signcryption provides confidentiality and authenticity efficiently;it can be used to design compact communication protocol.Arbitration mechanism is used for settling disputes in signcryption,but the information that the judge gets also brings some security problems.This paper points out two problems：in some scheme,the arbitrator can decrypt all the signcryptions of a receiver while be gets some kinds of arbitration message;in another schemes,the arbitration mechanism cannot protect the integrity of plaintext.Analyze the two kinds of problems and concludes their reasons separately,we proposed a resolvent that can solve the two problem by changing a secure arbitration message.Based on the attack and analysis,this paper proposes a secure arbitral signcryption （SASC）scheme and proves its IND-CCA2 security and UF-CMA security in random oracle model.Furthermore,SASC is a securely arbitral signcryption scheme,it can protect the integrity of plaintexts by an arbitration message associated with plaintext;and the scheme can resist decryption attacks of arbitrator,even he gets the arbitration message.SASC does not increase computation nor communication overloads;it has no limitation to the length of plaintext,which makes SASC more convenient.Proofs and analysis show that SASC is an efficient and secure scheme.
作者 粟栗 崔国华 李俊 郑明辉
机构地区 华中科技大学计算机学院
出处 《电子学报》 EI CAS CSCD 北大核心 2007年第11期2117-2122,共6页 Acta Electronica Sinica
基金 国家自然科学基金(No.6040 3027) 湖北省教育厅优秀中青年项目(No.Q200629001)
关键词 签密 仲裁安全 随机预言模型 可证明安全性 signcryption security of arbitration random Oracle provable security
分类号 TP309 [自动化与计算机技术—计算机系统结构]
作者简介 粟栗 男，1981年生予湖北省公安县，华中科技大学计算机学院博士生．主要研究方向为公钥密码、安全协议及可证明安全性．E—mail：hustsuli@gmail．com 崔国华 男，1947年生于江苏太仓，教授、博士生导师，现任教于华中科技大学计算机学院．主要研究方向为密码学、信息安全． 李俊 男，1979年生于湖北省武汉市，华中科技大学计算机学院博士生．主要研究方向为公钥密码，秘密分享． 郑明辉 男，1972年生于湖北省嘉鱼县，华中科技大学计算机学院博士生，湖北民族学院副教授．主要研究方向为公钥密码、密钥管理．
  • 相关文献

参考文献11

  • 1Zheng Y L. Digital signcryption or how to achieve cost( signature & encryption) ( cost (siganture) + cost (encryption) [ A ]. Kaliski B D. Advances in Cryptology-CRYFIO' 97 [ C ]. Berlin: Springer-Verlag, 1997. LNCS 1294:165-179.
  • 2Zheng Y L, Imai H. Using signcryption to build compact and unforgeable key establishment over an ATM network[ A]. Proceedings of IEEE INFOCOM' 98 [ C ]. San Francisco: CA, 1998.411-418.
  • 3王彩芬,贾爱库,刘军龙,于成尊.基于签密的多方认证邮件协议[J].电子学报,2005,33(11):2070-2073. 被引量：10
  • 4陈伟东,冯登国.签密方案在分布式协议中的应用[J].计算机学报,2005,28(9):1421-1430. 被引量：19
  • 5Baek J, Steinfeld R, Zheng Y L. Formal Proofs for the Security of Signcryption [ A ]. Naccache D. PKC 2002 [ C ]. Berlin: Springer-Vedag, 2002. LNCS 2274: 80-98.
  • 6Lee M K, Kim D K, Park K. An authenticated encryption scheme with public verifiability [ A ]. 5th Japan-Korea Joint Workshop on Algorithms and Computation [ C]. Tokyo: IEEE Press, 2000.49-56.
  • 7Jeong I R, Jeong H Y, Rhee H S. Provably secure encrypt-thensign composition in hybrid signcryption[ A]. Lee P J and Lim C H. ICISC 2002 [ C]. Berlin: Springer-Verlag, 2003. LNCS 2587:16-34.
  • 8张串绒,肖国镇.一个可公开验证签密方案的密码分析和改进[J].电子学报,2006,34(1):177-179. 被引量：16
  • 9Shin J B, Lee K, Shim K. New DSA-verifiable signcryption schemes[A] .Lee P J and Lim C H. ICISC 21302[ C] .Berlin: Springer-Verlag, 2003. LNCS 2587: 35-47.
  • 10Petersen H, Michels M. Cryptanalysis and improvement of signcryption schemes [ J ]. IEE Computers and Digital Communications, 1998,145(4) : 149-151.

二级参考文献39

  • 1Giuseppe Ateniese,Breno de Medeiros,Michael T Goodrich.TRICERT:A Distributed Certified E-Mail Scheme[A].Proc of NDSS'01[C].San Diego,CA:The Internet Society,2001.30-39.
  • 2J Zhou,D Gollmann.Certified Electronic Mail[A].Proc of Computer-Ecurity-Esorics'96[C].Rome,Italy:Springer-verlag,1996.55-61.
  • 3R H Deng,L Gong,A A Lazar,W Wang.Practical protocols for certified electronic mail[J].Journal of network and systems management,1996,4(3):279-297.
  • 4N Asokan,Victor Shoup,Michael Waider.Optimistic fair exchange of digital signatures[J].IEEE Journal On Selected Areas In Communications,2000,18(4):593-610.
  • 5N Asokan,V Shoup,M Waidner.Asynchronous Protocols For Optimistic Fair Exchange[A].Proc of 1998 IEEE symposium on security and privacy[C].Oakland,USA:IEEE computer society press,1998.86-99.
  • 6M M Puigserver,J L F Gomila,L H Rotger.Certified Electronic Mail Protocol Resistant To A Minority Of Malicious Third Parties[A].Proc Of IEEE INFOCOM 2000[C].Tel Aviv,Israel:IEEE computer society press,2000.1401-1405.
  • 7L F Gomila,M Payeras-Capella,L H Rotger.An Efficient Protocol Certified Electronic Mail[A].Proc of ISW'2000[C].LNCS1975,Wollongong,NSW,Australia:Springer-verlag,2000.237-248.
  • 8Matt Franklin,Gene Tsudik.Secure Group Barter:Multi-Party Fair Exchange With Semi-Trusted Neutral Parties[A].Proc of Financial Cryptography'98[C].LNCS1465,Anguilla,Springer-verlag,1998.90-102.
  • 9Steve Kremer,Olivier Markowitch.A Multi-Party Non-Repudiation Protocol[A].Proceedings of the 3rd International Conference on Information Security and Cryptology (ICISC 2000)[C].LNCS 2015,Seoul,Korea:Springer,2001.109-122.
  • 10N Asokan,M Schunter,M Waidner.Optimistic Protocols for Multi-Party Fair Exchange[R].IBM Research Report RZ 2892,Zurich,November 1996.

共引文献40

同被引文献17

  • 1ZHENG Y. Digital signcryption or how to achieve cost (signature & encryption) << cost (signature) -1-cost (encryption) [C]. In Proceedings Crypto' 97. Springer-Verlag, 1997:165-179.
  • 2LIBERT B, QUISQUATER J J. Improved signcryption from q-Diffie-Hellman problems[C]. Security Communication Networks-SCN04, LNCS. Berlin: Springer-Verlag, 2005 : 220-234.
  • 3TSO R, OKAMOTO T, OKAMOTO E. An improved signcryption Scheme and its variation[C]. Proceedings of the International Conference on Information Technology, 2007: 772-778.
  • 4MAC. Efficient short signcryption scheme with public verifiability[C]. Inscrypt'2006, LNCS4328, Berlin: Springer, 2006 : 118-129.
  • 5LI F, XIN X, HU Y. Indentity-based broadcast signeryption [J]. Computer Standards & Interfaces, 2008, 30(1) :89-94.
  • 6SHAMIR A. Identity-based cryptosystems and signature schemes[C]. Crypto' 84, Springer-Verlag. 1984:47-53.
  • 7RIVEST R L, SHAMIR A, TAUMAN Y. How to leak a secret [A]. Asiacrypt'2001, LNCS 2248, Springer-Verlag, 2001 : 552-565.
  • 8HUANG X, SUSILO W, MU Y. Identity-based ring signcryption schemes: Cryptographic primitives for preserving privaey and authenticity in, the ubiquitous world[C]. Proeeedings of the AINA' 05, 2005:1-6.
  • 9ZHANG M, YANG B, ZHU S, et al. Efficient secret authenticatable anonymous signcryption scheme with identity privacy [C]. In Intelligence and Security Informaties-ISI 2008, LNCS 5075, Springer-Verlag, 2008 : 126-137.
  • 10BLAKE l, SEROUSSI G, SMART N. Advances in elliptic curve cryptography [C]. London Mathematical Society Lecture Note,Series. Cambridge: Cambridge University Press, 2005.

引证文献2

二级引证文献1

电子学报
2007年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
关于我们 | 版权声明 | 联系我们 | 帮助中心| 意见反馈
主办单位：上海市教育委员会
技术支持：重庆维普资讯有限公司
渝公网安备 50019002500403号
使用帮助 返回顶部