Efficient sealed-bid auctions for massive numbers of bidders with lump comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2200, Issue , 2001, Pages 408-419

  Chida, Koji ^a   Kobayashi, Kunio ^a   Morita, Hikaru ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

SEALED-BID AUCTIONS;

COMMERCE;

EID: 84947288202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45439-x_28     Document Type: Conference Paper

References (12)

1. D. Boneh, “The Decision Diffie-Hellman Problem,” Proc. of ANTS-III, LNCS 1423, Springer-Verlag, pp. 48-63, 1998.
2. C. Cachin, “Efficient Private Bidding and Auctions with an Oblivious Third Party,” Proc. of ACM-CCS’99, 1999.
3. W. Diffie and M. Hellman, “NewDirections in Cryptography,” IEEE Trans. on Information Theory, IT-22, 6, pp. 644-654, 1976.
4. M. Jakobsson, M. Yung, “Proving Without Knowing: On Oblivious, Agn stic and Blindfolded Provers,” Proc. of CRYPTO 96, LNCS 1109, Springer- Verlag, pp. pp. 186-200, 1996.
5. H. Kikuchi, M. Harkavy and D. Tygar, “Multi-Round Anonymous Auction Protocols,” IEICE Trans. Inf. & Syst., Vol. E82-D, No.4, pp. 769-777, 1999.
6. M. Naor and B. Pinkas, “Oblivious Transfer and Polynomial Evaluation,” Proc. of 31st STOC, pp. 245-254, 1999.
7. M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design,” ACM Workshop on E-Commerce, 1999.
8. M. Naor and O. Reingold, “Number-Theoretic Constructions of Efficient Pseudo-Random Functions,” Extended abstract in: Proc. of 38th FOCS, pp. 458-467, 1997.
9. R. L. Rivest and A. Shamir, “PayWord and MicroMint–Two simple micropayment schemes,” Proc. of 1996 International Workshop on Security Protocols, LNCS 1189, pp. 69-87, 1996.
10. K. Sako, “An auction protocol which hides bids of losers,” Proc. Of PKC’2000, pp. 422-432, 2000.
11. A.C. Yao, “Protocols for Secure Computations,” Proc. of FOCS, pp. 160-164, 1982.
12. A.C. Yao, “Howto Generate and Exchange Secrets,” Proc. of FOCS, pp. 162-167, 1986.