Efficient English Auction Scheme Without A Secure Channel
INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY(2015)
摘要
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.
更多查看译文
关键词
English auction, bilinear pairings, bilinear Diffie-Hellman problem, hash function
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要