The Design and Implementation of a Secure Auction Service
IEEE Transactions on Software Engineering
Communications of the ACM
PayWord and MicroMint: Two Simple Micropayment Schemes
Proceedings of the International Workshop on Security Protocols
An Auction Protocol Which Hides Bids of Losers
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Electronic auctions with private bids
WOEC'98 Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3
A Practical English Auction with One-Time Registration
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Efficient Public Auction with One-Time Registration and Public Verifiability
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Receipt-Free Sealed-Bid Auction
ISC '02 Proceedings of the 5th International Conference on Information Security
M+1-st Price Auction Using Homomorphic Encryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
| Hi-index | 0.00 |
Some works about an electronic auction protocol have been proposed. 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 2k 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. 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.