Anonymity and verifiability in multi-attribute reverse auction

TL;DR

This paper presents a simple, effective scheme for ensuring anonymity and public verifiability in multi-attribute reverse e-Auctions, avoiding complex communications and third-party reliance.

Contribution

It introduces a novel scheme that achieves bid anonymity and public verifiability in multi-attribute auctions using scoring functions and pseudonym generation.

Findings

Ensures bid privacy and anonymity without revealing bids.

Achieves public verifiability through scoring functions.

Simplifies the auction process by reducing third-party dependencies.

Abstract

The use of e-Auction services has been increasing in recent years. Security requirements in conducting e-Auctions are mainly bid privacy, anonymity and public verifiability. Most of the secure protocols concentrate on privacy and anonymity, which are achieved through bidder-resolved multi-party computation, assuming two or more trusted third parties, either through numerous auctioneers or with asymmetric models in which the commercial entity of an auction issuer or registration manager is assumed in addition to the auctioneer. Multi-attribute reverse auctions promise higher market efficiency and effective information exchange. This work extends and uses the existing schemes. This scheme uses scoring function, winner determination in multi-attribute auctions to implement public verifiability. Anonymity is achieved through bidder side pseudonym generation. By results and analysis we say this is very simple and effective scheme. This scheme ensures public verifiability and anonymity in multi-attribute auctions without revelation of the bids received, third parties and complex communications.