An Online English Auction Scheme

Online English auction is most familiar and mostly used online auction process in the present scenario. It is the most efficient auction process which gives most desirable results in terms of revenue . Our scheme involves three parties, namely the Registration Manager(RM), Auction Manager(AM), and Bidder(B). The Registration Manager publicizes the parameters to register the bidders, allowing them to participate in the bidding process. It also protects the bidding rights and manages the information on the key. The Auction Manager is responsible for conducting the bidding after the registration is over. Our proposed scheme satisfies the following features such as anonymity, no framing, unforgeability, non-repudiation, fairness, public verifiability, one-time registration, and easy revocation. The scheme uses Discrete Logarithmic Problem (DLP) and Secure Hash Algorithm (SHA-1) as hash function

Online English Auction Scheme

Online English auction is most familiar and mostly used online auction process in the present scenario. It is the most efficient auction process which gives most desirable results in terms of revenue. Our scheme involves three parties, namely the Registration Manager(RM), Auction Manager(AM), and Bidder(B). The Registration Manager publicizes the parameters to register the bidders, allowing them to participate in the bidding process. It also protects the bidding rights and manages the information on the key. The Auction Manager is responsible for conducting the bidding after the registration is over. Our proposed scheme satisfies the following features such as anonymity, no framing, unforgeability, non-repudiation, fairness, public verifiability, one-time registration, and easy revocation. The scheme uses Discrete Logarithmic Problem (DLP) and Secure Hash Algorithm (SHA-1) as hash function

Online English Auction Scheme

Online English auction is most familiar and mostly used online auction process in the present scenario. It is the most efficient auction process which gives most desirable results in terms of revenue. Our scheme involves three parties, namely the Registration Manager(RM), Auction Manager(AM), and Bidder(B). The Registration Manager publicizes the parameters to register the bidders, allowing them to participate in the bidding process. It also protects the bidding rights and manages the information on the key. The Auction Manager is responsible for conducting the bidding after the registration is over. Our proposed scheme satisfies the following features such as anonymity, no framing, unforgeability, non-repudiation, fairness, public verifiability, one-time registration, and easy revocation. The scheme uses Discrete Logarithmic Problem (DLP) and Secure Hash Algorithm (SHA-1) as hash function

Brandt's fully private auction protocol revisited

International audienceAuctions have a long history, having been recorded as early as 500 B.C. [Kri02]. Nowadays, electronic auctions have been a great success and are increasingly used in various applications, including high performance computing [BAGS02]. Many cryptographic protocols have been proposed to address the various security requirements of these electronic transactions, in particular to ensure privacy. Brandt [Bra06] developed a protocol that computes the winner using homomorphic operations on a distributed ElGamal encryption of the bids. He claimed that it ensures full privacy of the bidders, i.e. no information apart from the winner and the winning price is leaked. We first show that this protocol – when using malleable interactive zero-knowledge proofs – is vulnerable to attacks by dishonest bidders. Such bidders can manipulate the publicly available data in a way that allows the seller to deduce all participants' bids. We provide an efficient parallelized implementation of the protocol and the attack to show its practicality. Additionally we discuss some issues with verifiability as well as attacks on non-repudiation, fairness and the privacy of individual bidders exploiting authentication problems