|
计算机科学 2008
An Anonymous Efficient (M + 1)-st Electronic Auction
|
Abstract:
Security and privacy are the crucial condition in the seal-auction design.A new scheme for(M 1)-st electronic sealed-bid auctions based on the RSA function is presented,which preserves losing bids and bidders's anonymous identities.No bidder can repudiate his or her bid.In our scheme,opening bids requires at most p rounds of interactions and 2p log2t modular multiplications where p is the range of bids and t is the RSA public-key.The computational cost is independent of the number of bidders.The scheme is secure and much more efficient than the previous schemes.