Advertisement

Secure Receipt-Free Sealed-Bid Electronic Auction

  • Jaydeep Howlader
  • Anushma Ghosh
  • Tandra DebRoy Pal
Part of the Communications in Computer and Information Science book series (CCIS, volume 40)

Abstract

The auction scheme that provides receipt-freeness, prevents the bidders from bid-rigging by the coercers. Bid-rigging is a dangerous attack in electronic auction. This happen if the bidder gets a receipt of his bidding price, which proves his bidding prices, from the auction protocol. The coercers used to force the bidders to disclose their receipts and hence bidders lose the secrecy of their bidding prices. This paper presents a protocol for a receipt-free, sealed-bid auction. The scheme ensures the receipt-freeness, secrecy of the bid, secrecy of the bidder and public verifiability.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance 16(1), 8–37 (1961)CrossRefGoogle Scholar
  2. 2.
    Benaloh, J., Tuinstra, D.: Receipt-free secter-ballot election (extended abstract). In: Proc. 26th ACM Symposium on the Theory of Computing (STOC), pp. 544–553. ACM Press, New York (1994)Google Scholar
  3. 3.
    Sakurai, K., Miyazaki, S.: An Anonymous Election 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)CrossRefGoogle Scholar
  4. 4.
    Sakurai, K., Miyazaki, S.: A Bulletin-Board Based Digital Auction Scheme with Bidding Down Strategy-Towards Anonymous Electronic Bidding without Anonymous Channels nor Trusted Centers. In: Proc. International Workshop on Cryptographic Techniques and E-Commerce (CryTEC 1999), pp. 180–187 (1999)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Franklin, M.K., Reiter, M.K.: The Design an Implementation of a Secure Auction Service. IEEE Trans. Softw. Eng. 22(5), 302–312 (1996)CrossRefGoogle Scholar
  8. 8.
    Kikuchi, H., Harkavy, M., Tygar, J.D.: Multi-round Anonymous Auction Protocol. In: Proc. 1st IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62–69 (1998)Google Scholar
  9. 9.
    Kudo, M.: Secure Electronic Sealed-Bid Auction Protocol with Public Key Cryptography. Trans. IEICE trans. on Fundamentals of Electronics, Communications and Computer Sciences E81-A(1), 20–27 (1998)Google Scholar
  10. 10.
    Abe, M., Suzuki, K.: M + 1st Price Auction using Homomorphic Encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 115–124. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Chen, X., Lee, B., Kim, K.: Receipt-Free Electronic Auction Scheme using Homorphic Encryption. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 259–273. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Harkavy, M., Tygar, J.D., Kikuchi, H.: Electronic Auction with Private Bids. In: Proc. 3rd USENIX Workshop on Electronic Commerce (1998)Google Scholar
  14. 14.
    Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 90–104. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  15. 15.
    Chaum, D., Pedersen, T.P.: Wallet Database with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  16. 16.
    Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)CrossRefGoogle Scholar
  17. 17.
    Chaum, D.L.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM 24(2), 84–88 (1981)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jaydeep Howlader
    • 1
  • Anushma Ghosh
    • 2
  • Tandra DebRoy Pal
    • 1
  1. 1.National Institute of TechnologyDurgapurIndia
  2. 2.Microsoft India (R&D) Pvt. Ltd.HyderabadIndia

Personalised recommendations