Volume 1 Number 2 (May 2006)
Home > Archive > 2006 > Volume 1 Number 2 (May 2006) >
JCP 2006 Vol.1(2): 33-41 ISSN: 1796-203X
doi: 10.4304/jcp.1.2.33-41

Improved Double Auction Protocol based on a Hybrid Trust Model

JungHoon Ha1, Jianying Zhou2, SangJae Moon3
1School of Electrical Eng. & Computers Science, Kyungpook National Univ., Daegu, Korea
2Institute for Infocomm Research, 21 Heng Mui Keng Terrace, Singapore
3School of Electrical Eng. & Computers Science, Kyungpook National Univ., Daegu, Korea


Abstract—Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive in computation, and are not robust in dealing with system malfunction or user misbehavior. In this paper, we propose a secure and practical double auction protocols based on a hybrid trust model, where computation load is distributed to buyers and sellers while a semi-trusted manager handles the registration phase. A prominent feature of the proposed protocol is its high robustness, achieved by using a publicly verifiable secret sharing scheme with threshold access structure.

Index Terms—Double auction, security, trust model

[PDF]

Cite: JungHoon Ha, Jianying Zhou, SangJae Moon, "Improved Double Auction Protocol based on a Hybrid Trust Model," Journal of Computers vol. 1, no.2, pp. 33-41 , 2006.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>