期刊文献+

新的无中央机构的电子选举协议

New E-voting protocol without authority
下载PDF
导出
摘要 文献[1]提出了一个无中央机构的电子投票协议,这种签名适合用在选举人在电子选举时找不到可信中心对选票进行认证的时候。但是,给出的一种攻击证明该协议是不安全的,不诚实的投票人可以控制整个选举的结果而不被其他人所察觉。针对上述缺点设计一个改进的新方案,主要引入一个不同底相同离散对数的知识证明来保证投票者给出正确的私钥。并对新方案的安全性进行了分析。最后对新方案的执行效率和还存在的缺陷进行分析。 An electronic voting protocol without authority is proposed by literature [1], which is suitable when voters can't find a eredible center to authenticate the vote the in e-voting. But the scheme is insure by given an attack" a dishonest voter can control the result of voting without realizing by others. An improved scheme is proposed to overcome the disadvantages, which ensure the voter to give out his correct private key by using two different bases and the same discrete logarithm proof of knowledge. Then we analyze the security of new scheme. At last, the efficiency and the shortcomings of the new scheme are analyzed.
作者 张小萍 钟诚
出处 《计算机工程与设计》 CSCD 北大核心 2007年第13期3136-3137,3159,共3页 Computer Engineering and Design
关键词 无中央机构 电子投票 改进 离散对数 知识证明 without authority electronic vote improvement discrete logarithm proof of knowledge
  • 相关文献

参考文献10

二级参考文献33

  • 1孙玉海,孟丽荣.基于多级入侵容忍的数据库安全解决方案[J].计算机工程与设计,2005,26(3):694-696. 被引量:13
  • 2施奈尔著. 吴世忠 祝世雄 张文政 等译.应用密码学:协议、算法与C源程序[M].北京:机械工业出版社,2000..
  • 3[1]Cramer R, Gennaro R, Schoenmakers B. A Secure and Optimally Eifficient Multi-authority Election Scheme.In European Transactions on Telecommunications ,1997, 8(5):481-490
  • 4[2]Radwin M J. An Untraceable, Universally Verifiable Voting Scheme. Seminar in Cryptology Professor Philip Klein, 1995-12
  • 5[3]A Verifiable Multi-authroties Secret Election Allowing Abstaining from Voting. 1998
  • 6[4]Hevia A, Kivi M. Electronic Jury Voting Protocols. http:// cite- seer.nj. nec.com/hevia01electronic.html, 2001
  • 7[6]Cramer R. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Advances in Cryptology-CRYPTO94, Springer-Verlag. 1994
  • 8Brands S. Untraceable off-line cash in wallets with observers[A].Proceedings of Crypto'93[C]. Lecture Notes in Computer Science 773, Springsr-Verlag, 1993. 302 -318.
  • 9Frankel Y, Tsiunis Y, Yung M. Indirect discourse proof: achieving fair off-line e-cash[A]. Advances in Cryptology - ASIACRYPT' 96[C]. Lecture Notes in Computer Science 1163, Springer-Verlag,1996.286 - 300.
  • 10Lysyanskaya A, Ramzan Z. Group blind digital signatures: a scalable solution to electronic cash[A]. Proceedings of the second international conference of Financial Cryptography[C]. Lecture Notes in Computer Science 1465, Springer-Verlag, 1998. 184 - 197.

共引文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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