期刊文献+

一个新的多拍卖物的无收据密封式拍卖协议

New receipt-free multiple items auction protocol
下载PDF
导出
摘要 通过对黄征等人的拍卖方案(文献[1])的分析,发现其方案中用于检验竞拍者标价的随机数的产生过程存在着安全隐患,这将导致竞拍者标价的提前泄露。针对这类情况,提出了相应的改进方案,解决了标价泄露的问题,并且分析和证明了该改进方案的安全性。 Through analyse on the reference [1],we find tenderer's bids may be leaked that because of the producing course of random numbers which are used to test bids have some faults.We propose an improved scheme to solve that problem.Our improved scheme can solves the secure hidden dangers and have higher security and efficiency than reference[1].
作者 董涛 余昭平
出处 《计算机工程与应用》 CSCD 北大核心 2007年第10期156-158,共3页 Computer Engineering and Applications
基金 现代通信国家重点实验室基金(No.51436020405JB5205)
关键词 电子拍卖 多拍卖物 安全多方计算 秘密共享 electronic auction multiple items secure multiparty computation sharing secret
  • 相关文献

参考文献4

  • 1黄征,郑东,陈克非.多拍卖物的无收据密封式电子拍卖协议[J].中国科学院研究生院学报,2005,22(1):83-89. 被引量:6
  • 2Matthew K F,Michael K R.The design and implementation of a secure auction service[J].IEEE Transactions on Software Engineering,1996,22(5):302-312.
  • 3Abe M,Suzuki K.Receipt-free sealed-bid auction[C]//LNCS 2433:Proceedings of ISC 2002,2002:191-199.
  • 4Kikuchi H.(M+1)st-price auction protocol[C]//Syverson P.LNCS 2339:FC2001,2002:351-363.

二级参考文献7

  • 1Matthew KF, Michael KR. The design and implementation of a secure auction service. IEEE Transactions on Software Engineering, 1996,22(5) :302 - 312.
  • 2Sako K. Universally verifiable auction protocol which hides losing bids. In:Proceedings of Public Key Cryptography 2000.2000.35 - 39.
  • 3Olivier B, Jacques S Non-interactive private auctions. Financial Cryptography: Fifth International Conference. Lecture Notes in Computer Science, 2001.
  • 4Chida K, Kobayashi K, Morita H. Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In: Proceeding's of ISC 2001. LNCS 2200,2001.408 - 419.
  • 5Kikuchi H. ( M + 1) st-price auction protocol. In:P Syverson(ed. ). FC2001. LNCS 2339,2002.351 - 363.
  • 6Abe M, Suzuki K. Receipt-free sealed-bid auction. In: Proceedings of ISC 2002. LNCS 2433,2002. 191 - 199.
  • 7Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for noneryptographie fault-tolerant distributed computations. In:Proc 20th Annual Symp on the Theory of Computing. 1988.1 - 10.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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