REVIEW
Anonymity and verifiability in multi-attribute reverse auction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Discussion (0). Continue with ORCID to comment.