Paper 2005/346 Original: eprint.iacr.org/2005/346 ↗
Batch Verification of Validity of Bids in Homomorphic E-auction
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.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2005-09-27: last updated
- 2005-09-27: published
- Short URL
- https://ia.cr/2005/346
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}