## CryptoDB

### Paper: Batch Verification of Validity of Bids in Homomorphic E-auction

Authors: Kun Peng Colin Boyd Ed Dawson URL: http://eprint.iacr.org/2005/346 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2005-12680,
title={Batch Verification of Validity of Bids in Homomorphic E-auction},
booktitle={IACR Eprint archive},
keywords={applications / homomorphic e-auction, bid validity check, batch verification, oblivious transfer},
url={http://eprint.iacr.org/2005/346},
note={accepted by Internet Communications Security Special Issue of the journal of Computer Communications k.peng@qut.edu.au 13052 received 26 Sep 2005},
author={Kun Peng and Colin Boyd and Ed Dawson},
year=2005
}