Abstract
Bid-rigging is a dangerous attack in electronic auction. Abe and Suzuki firstly introduced the idea of receipt-free to prevent this attack. In this paper we point out that Abe and Suzuki’s scheme only provides receipt-freeness for losing bidders. We argue that it is more important to provide receipt-freeness for winners and propose a new receipt-free sealed bid auction scheme using the homomorphic encryption technique. In contrast to Abe and Suzuki’s scheme, our scheme satisfies privacy, correctness, public verifiability and receipt-freeness for all bidders. Also, our scheme is not based on threshold trust model but three-party trust model, so it is more suitable for real-life auction. Furthermore, we extend our scheme to M+1-st price receipt-free auction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abe, M., Suzuki, K.: M+1-st Price Auction using Homomorphic Encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 115–124. Springer, Heidelberg (2002)
Abe, M., Suzuki, K.: Receipt-Free Sealed-Bid Auction. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 191–199. Springer, Heidelberg (2002)
Baudron, O., Stern, J.: Non-interactive Private Auctions. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 364–377. Springer, Heidelberg (2002)
Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: Proc. of 26th Symp. on Theory of Computing (STOC 1994), pp. 544–553 (1994)
Brandt, F.: Secure and private auctions without auctioneers, Technical Report FKI-245-02, Institut fur Informatik, Technische Universitat Munchen (2002)
Cachin, C.: Efficient private bidding and auctions with an obvilious third party. In: Proceeding of the 6th ACM Conference on Computer and Communications Security, pp. 120–127 (1999)
Cramer, R., Damgkd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)
Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi- Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)
Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)
Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction server. IEEE Trans. on Software Engineering 22(5), 302–312 (1996)
Harkavy, M., Kikuch, H., Tygar, J.D.: Electronic Auction with Private Bids. In: Proceeding of the 3rd USENIX Workshop on Electronic Commence (1998)
Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 393–403. Springer, Heidelberg (2000)
Juels, A., Szydlo, M.: A Two-Sever, Sealed-Bid Auction Protocol. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357. Springer, Heidelberg (2003)
Kikuchi, H.: (M+1)st-Price Auction Protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 341–363. Springer, Heidelberg (2002)
Kilian, M., Pertrank, E.: Identity Escrow. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 169–185. Springer, Heidelberg (1998)
Lee, B., Kim, K.: Receipt-free electronic voting scheme with a tamper-resistant randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 389–406. Springer, Heidelberg (2003)
Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions without Threshold Trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87–101. Springer, Heidelberg (2003)
Naor, M., Prinkas, B., Summer, R.: Privacy Preserving Auctions and Mechanism Design. In: Proceedings of ACM conference on E-commerce, pp. 129–139. Springer, Heidelberg (1999)
Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25–35. Springer, Heidelberg (1998)
Sako, K.: An Auction Protocol Which Hides Bids of Losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 422–432. Springer, Heidelberg (2000)
Sako, K., Kilian, J.: Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)
Sakurai, K., Mkiyazaki, S.: An Anonymous Electronic Bidding Protocol Based on a New Convertible Group Signature Scheme. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 385–399. Springer, Heidelberg (2000)
Stubblebine, S.G., Syverson, P.F.: Fair On-line Auction without Special Trusted Parties. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, pp. 230–240. Springer, Heidelberg (1999)
Suzuki, K., Kobayashi, K., Morita, H.: Efficient Sealed-bid Auction Using Hash Chain. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 183–191. Springer, Heidelberg (2001)
Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)
Wurman, P.R., Walsh, W.E., Wellman, M.P.: Flexible Double Auctions for Electronic Commerce: Theory and Implementation. Decision Support Systems 24, 17–27 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Lee, B., Kim, K. (2004). Receipt-Free Electronic Auction Schemes Using Homomorphic Encryption. In: Lim, JI., Lee, DH. (eds) Information Security and Cryptology - ICISC 2003. ICISC 2003. Lecture Notes in Computer Science, vol 2971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24691-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24691-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21376-5
Online ISBN: 978-3-540-24691-6
eBook Packages: Springer Book Archive