International Journal of Wireless and Microwave Technologies (IJWMT)
IJWMT Vol. 2, No. 1, 15 Feb. 2012
Cover page and Table of Contents: PDF (size: 218KB)
A double auction scheme based on secret sharing and safe comparing protocol
Full Text (PDF, 218KB), PP.60-65
Views: 0 Downloads: 0
Author(s)
Bin Zhang
1,*
Qiuliang Xu
1
Han Jiang
1
Index Terms
Double auction, safe comparing, secret sharing, secure multiparty computation
Abstract
At present most practical electrical auction schemes that based on secret sharing, group signature and hash chain assume the existence of a trusted thid party, while the schemes that based on commitment, zero knowledge or homomorphic encryption without the TTP model face the problem of high cost of communication and computation. The double auction scheme proposed by Bogetoft is based on secure multiparty computation without a TTP and get very high efficiency. In this article, we improve the above scheme. Based on secret sharing and constant round safe comparing protocol, we reduce the requirement of honest majority in the original scheme. We improve the security of the scheme while maintain the high efficiency.
Cite This Paper
Bin Zhang,Qiuliang Xu,Han Jiang,"A double auction scheme based on secret sharing and safe comparing protocol", IJWMT, vol.2, no.1, pp.60-65, 2012. DOI: 10.5815/ijwmt.2012.01.09
Reference
[1] Chen Xiaofeng, Wang Yumin. The research status and development of electronical auction.. Academic journal of communication. 23(12):pp 73 - 81. 2002, （in Chinese）
[2] M. Franklin, and M. Reiter, The Design and Implementation of a Secure Auction Service. In Proc. IEEE Symp. on Security and Privacy (Oakland, Ca, 1995), IEEE Computer Society Press, pp. 2–14. 1995
[3] M. Kudo. Secure Electronic Sealed-bid Auction Protocol with Public Key Cryptography[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, 81(1): pp.20-27. 1998,
[4] K.Sakurai and S.Miyazaki, An anonymous electronic bid- ding protocol based on a new convertible group signature scheme, in Proceedings of the 5th Australasian Conference on Information and Privacy (ACISP 2000), pp. 385-399, 2000.
[5] K.Suzuki, K. Kobayashi, and H. Morita, “Efficient sealed-bid auction using hash chain," in Proceedings of the 3th Interna- tional Conference on Information Security and Cryptology (ICISC 2000), pp. 189-197, 2000.
[6] M. Abe, K. Suzuki .Receipt free sealed bid auction. In : Proceedings of ISC 2002. LNCS 2433 , pp 191～199. 2002.
[7] F. Brandt . Fully private aucti ons in a constant number of rounds. Proceedings of the 7th Annual Conference on Financial Cryptography (FC) ,LNCS 2742 . Berlin: Springer Verlag,: pp 223 - 238 . 2003
[8] P. Bogetoft, D.L. Christensen, I. Damgard, M. Geisler, T. Jakobsen, M. Krøigaard, J.D. Nielsen, J.B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach and T. Toft. Multi-Party Computation Goes Live. Cryptology ePrint Archive, Report 2008/068, 2008.
[9] Qin Bo, Qin Hui, Zhou Kefu, Wang Xiaofeng, Wang Yumin.The Millionaire protocol with constant round complexity. Journal of Xi’an University of Technology. Vol. 21 No. 2, pages 149~152, 2005（in Chinese）