论文信息 - An Anonymous Bidding Protocol without Any Reliable Center

An Anonymous Bidding Protocol without Any Reliable Center

An anonymous bidding protocol without any reliable center for a small community is proposed. The anonymity of a bidding protocol means that the participation of everyone involved in the bidding except for the successful bidder is kept secret. Since it is hard for a small community to establish a reliable center owing to the difficulty and cost of doing so, an anonymous bidding protocol without any reliable center is appropriate to its needs. In such a bidding protocol, a bidder can withdraw his bid after the deadline for bidding by ceasing to participate in the bidding. If this can be done anonymously, the price of the successful bid would be illegally manipulated by conspiratorial bidders. In the bidding protocol proposed in this paper, such a bidder can be identified. This discourages conspiratorial bidders from manipulating the price of the successful bid through withdrawing, by applying some sanctions against their acts.

Toru Fujiwara | Toru Nakanishi | Hajime Watanabe

[1] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[2] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[3] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[4] Hiroaki Kikuchi,et al. Multi-round Anonymous Auction Protocols , 1999 .

[5] Matthew K. Franklin,et al. The design and implementation of a secure auction service , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[6] Toru Fujiwara,et al. A Linkable Group Signature and Its Application to Secret Voting , 1999 .

[7] Jan Camenisch,et al. Efficient group signature schemes for large groups , 1997 .

[8] Yiannis Tsiounis,et al. On the Security of ElGamal Based Encryption , 1998, Public Key Cryptography.