欢迎访问中国科学院大学学报,今天是
论文

多拍卖物的无收据密封式电子拍卖协议

  • 黄征 ,
  • 郑东 ,
  • 陈克非
展开
  • 上海交通大学信息安全学院计算机系 上海200030

收稿日期: 2003-04-15

  修回日期: 2003-06-17

  网络出版日期: 2005-01-15

基金资助

国家自然科学基金项目(60273049,90104005)资助

Receipt-Free Multiple Items Auction Protocol

  • Huang Zheng ,
  • Zheng Dong ,
  • Chen Kefei
Expand
  • Department of Computer Science and Engineering, Institute of Information Security, Shanghai JiaoTong University, Shanghai 200030, China

Received date: 2003-04-15

  Revised date: 2003-06-17

  Online published: 2005-01-15

摘要

使用秘密分享的方法来构造多拍卖物的电子拍卖协议,并按照电子拍卖协议应该满足的各种性质对提出的协议进行了分析。相对于适用于单拍卖物的电子拍卖协议,适用于多拍卖物的电子拍卖协议具有更广泛的用途。提出的协议具有“无收据”的性质,可以更好地保护竞拍者的隐私。

本文引用格式

黄征 , 郑东 , 陈克非 . 多拍卖物的无收据密封式电子拍卖协议[J]. 中国科学院大学学报, 2005 , 22(1) : 83 -89 . DOI: 10.7523/j.issn.2095-6134.2005.1.013

Abstract

We propose a receipt-free multiple items auction protocol using verifiable secret sharing and analyze this protocol based on the basic requirements of electronic auction protocol .Compared with the protocol that fits for single item auction , the protocol that fits for multiple items auction can be used in more areas .The receipt-free property of our protocol can give more protection to the bidders privacy

参考文献

[1] Matthew KF, Mi chael KR.The design and implementation of a secure auction service .IEEE Transactions on Sof tware Engineering ,1996 , 22(5):302—312

[2] Sako K .Universally verifiable auction protocol which hides losing bids .In :Proceedings of Publi c Key Cryptography 2000 .2000 .35—39

[3] Olivier B , Jacques S .Non-interactive private auctions .Financial Cryptography :Fifth International Conference.Lecture Notes in ComputerScience ,2001

[4] Chida K, Kobayashi K, Morita H .Efficient sealed-bid auctions for massive numbers of bidders with lump comparison .In :Proceedings of ISC2001 .LNCS 2200, 2001 .408—419

[5] Kikuchi H .(M+1)st-price auction protocol.In :P Syverson(ed .).FC2001 .LNCS 2339 , 2002 .351—363

[6] Abe M , Suzuki K.Receipt-f ree sealed-bid auction .In :Proceedings of ISC 2002.LNCS 2433 , 2002.191—199

[7] Ben-Or M, Goldwasser S , Wigderson A.Completeness theorems for noncryptographi c fault-tolerant distributed computations .In :Proc 20th AnnualSymp on the Theory of Computing.1988 .1—10

文章导航

/