An anonymous auction protocol with a single non-trusted center using binary trees

概要

論文の詳細を見る
Some works about an electronic auction protocol have been proposed[2, 3, 4, 5, 6 , 8 , 11 , 12]. An electronic auction protocol should satisfy the following seven properties: (a)Fair of bidders; (b)Security of bids; (c)Anonymity; (d)Validity of winning bids; (e)Non-repudiation; (f)Robustness; and (g)Efficient bidding points. As for anonymity, previous protocols assume some entities like a dealer or plural centers to be trusted. In this paper, anonymity is realized without a trusted center, maintaining both computational and round complexity low. Furthermore, we represent a bid efficiently by using binary trees: for 2^k bidding points, the size of the representation of bids is just k. Previous works investigating a sealed-bid auction aim at "efficiency" but not "entertainment" seen in English auction[2, 4, 5, 6, 11, 12]. We introduce a new idea of entertainment to the opening phase by decreasing winner candidates little by little. Our protocol has the following three main features in addition to the above seven properties: perfect anonymity(a single non-trusted center), efficient bidding points and entertainment.Information security : third international workshop, ISW 2000, Wollongong, Australia, December 20-21, 2000 : proceedings / Josef Pieprzyk, Eiji Okamoto, Jennifer Seberry (eds.).
Springerの論文