Cryptology ePrint Archive: Report 2005/346
Batch Verification of Validity of Bids in Homomorphic E-auction
Kun Peng, Colin Boyd and Ed Dawson
Abstract: Bid opening in e-auction is efficient when a homomorphic secret sharing function is employed to seal the bids and homomorphic secret reconstruction is employed to open the bids. However, this high efficiency is based on an assumption: the bids are valid (e.g. within a special range). An undetected invalid bid can compromise correctness and fairness of the auction. Unfortunately, validity verification of the bids is ignored in the auction schemes employing homomorphic secret sharing (called homomorphic auction in this paper). In this paper, an attack against the homomorphic auction in the absence of bid validity check is presented and a necessary bid validity check mechanism is proposed. Then a batch cryptographic technique is introduced and applied to improve the efficiency of bid validity check.
Category / Keywords: applications / homomorphic e-auction, bid validity check, batch verification, oblivious transfer
Publication Info: accepted by Internet Communications Security Special Issue of the journal of Computer Communications
Date: received 26 Sep 2005
Contact author: k peng at qut edu au
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Note: The paper has been accepted by Internet Communications Security Special Issue of the journal of Computer Communications, but has not been published.
Version: 20050927:150910 (All versions of this report)
Short URL: ia.cr/2005/346
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]