English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28607/40644
Visitors : 5906401      Online Users : 48
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40481

Title: Efficient English Auction Scheme without a Secure Channel
Authors: Tzong-Chen Wu
Tzuoh-Yi Lin
Tzong-Sun Wu
Han-Yu Lin
Contributors: 國立臺灣海洋大學:資訊工程學系
Keywords: hash function
bilinear pairings
English auction
bilinear Diffie-Hellman problem
Date: 2015
Issue Date: 2017-01-19T03:47:12Z
Publisher: The International Arab Journal of Information Technology
Abstract: 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.
Relation: 12(3)
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40481
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback