International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Kun Peng

Publications

Year
Venue
Title
2005
CRYPTO
2005
EPRINT
Batch Verification of Validity of Bids in Homomorphic E-auction
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.
2004
PKC

Coauthors

Colin Boyd (3)
Ed Dawson (3)
Kapalee Viswanathan (1)