A Multiplicative Homomorphic Sealed-Bid Auction Based on Goldwasser-Micali Encryption

  • Kun Peng
  • Colin Boyd
  • Ed Dawson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3650)


Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid auction with bid privacy.


auction bid privacy Goldwasser-Micali encryption multiplicative homomorphism 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer Security 28(2), 270–299 (1984)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Guillou, L.C., Quisquater, J.J.: A “paradoxical” identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    Kurosawa, K., Ogata, W.: Bit-slice auction circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol. 2502, pp. 24–38. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Paillier, P.: Public key cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)Google Scholar
  6. 6.
    Peng, K.: Analysis and Design of Secure Sealed-Bid Auction. PhD thesis, Information Security Research Centre, Queensland University of Technology (2004), Available at
  7. 7.
    Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Non-interactive auction scheme with strong privacy. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 407–420. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, privacy protecting and publicly verifiable sealed-bid auction. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 147–159. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Efficient implementation of relative bid privacy in sealed-bid auction. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol. 2908, pp. 244–256. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Shamir, A.: How to share a secret. Communication of the ACM 22(11), 612–613 (1979)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kun Peng
    • 1
  • Colin Boyd
    • 1
  • Ed Dawson
    • 1
  1. 1.Information Security InstituteQueensland University of Technology 

Personalised recommendations