ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Efficient English Auction Scheme without a Secure Channel

Journal: The International Arab Journal of Information Technology (Vol.12, No. 3)

Publication Date:

Authors : ; ; ; ;

Page : 246-252

Keywords : English auction; bilinear pairings; bilinear Diffie-Hellman problem; hash function.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

English auctions become tremendously popular on the Internet today. This paper presents a new English auction scheme that can be realized in the public network environments without any additional secure channel. Our scheme not only satisfies security requirements of anonymity, traceability, no framing, fairness, public verifiability, unlinkability among different rounds of auction and linkability in an auction round, but also provides one-time registration and easy revocation. Furthermore, as compared with the pervious works, the proposed scheme has a better performance in terms of the computation and the size of bidding information

Last modified: 2019-11-17 17:57:12