Paper 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.

Note: The paper has been accepted by Internet Communications Security Special Issue of the journal of Computer Communications, but has not been published.

Metadata
Available format(s)
PS
Category
Applications
Publication info
Published elsewhere. accepted by Internet Communications Security Special Issue of the journal of Computer Communications
Keywords
homomorphic e-auctionbid validity checkbatch verificationoblivious transfer
Contact author(s)
k peng @ qut edu au
History
2005-09-27: received
Short URL
https://ia.cr/2005/346
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/346,
      author = {Kun Peng and Colin Boyd and Ed Dawson},
      title = {Batch Verification of Validity of Bids in Homomorphic E-auction},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/346},
      year = {2005},
      url = {https://eprint.iacr.org/2005/346}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.