Efficient English Auction Scheme without a Secure Channel
Journal: The International Arab Journal of Information Technology (Vol.12, No. 3)Publication Date: 2015-05-01
Authors : Tzong-Chen Wu; Tzuoh-Yi Lin; Tzong-Sun Wu; Han-Yu Lin;
Page : 246-252
Keywords : English auction; bilinear pairings; bilinear Diffie-Hellman problem; hash function.;
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
Other Latest Articles
- Arabic Phonemes Transcription using Data Driven Approach
- An Efficient Content Based Image Retrieval using Advanced Filter Approaches
- An Efficient ROI Encoding Based on LSK and Fractal Image Compression
- Face Recognition using Truncated Transform Domain Feature Extraction
- Smelling the Web Olfactory Display for Web Objects
Last modified: 2019-11-17 17:57:12