Journal of University of Chinese Academy of Sciences >
Receipt-Free Multiple Items Auction Protocol
Received date: 2003-04-15
Revised date: 2003-06-17
Online published: 2005-01-15
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 bidders privacy
Huang Zheng , Zheng Dong , Chen Kefei . Receipt-Free Multiple Items Auction Protocol[J]. Journal of University of Chinese Academy of Sciences, 2005 , 22(1) : 83 -89 . DOI: 10.7523/j.issn.2095-6134.2005.1.013
[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 :Proceedings 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
/
| 〈 |
|
〉 |