M + 1-st price auction using homomorphic encryption

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

Volumn 2274, Issue , 2002, Pages 115-124

  Abe, Masayuki ^a   Suzuki, Koutarou ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; PUBLIC KEY CRYPTOGRAPHY;

BIDDING PRICES; COMMUNICATION COMPLEXITY; HO-MOMORPHIC ENCRYPTIONS; MIX AND MATCH; PRICE AUCTION; PUBLIC VERIFIABILITY; TRUSTED AUTHORITIES;

CRYPTOGRAPHY;

EID: 84958964379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_8     Document Type: Conference Paper

References (22)

1. M. Abe, “Mix-Networks on Permutation Networks”, Proceedings of ASIACRYPT’99, pp. 317–324, (1999).
2. M. Abe and F. Hoshino, “Remarks on Mix-network based on Permutation Network”, Proceedings of PKC2001, pp. 317–324, (2001).
3. O. Baudron and J. Stern, “Non-interactive Private Auctions”, Proceedings of Financial Cryptography 2001,, (2001).
4. C. Cachin, “Efficient Private Bidding and Auctions with an Oblivious Third Party”, Proceedings of 6thA CM Conference on Computer and Communications Security, pp. 120–127, (1999).
5. R. Cramer, I. Damgård and B. Schoenmakers, “Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocol”, Proceedings of CRYPTO’94, pp. 174–187, (1994).
6. K. Chida, K. Kobayashi and H. Morita, “Efficient Sealed-bid Auctions for Massive Numbers of Bidders with Lump Comparison”, Proceedings of ISC’01,, (2001).
7. D. L. Chaum and T. P. Pedersen, “Wallet Databases with Observers”, Proceedings of CRYPTO’92, pp. 89–105, (1992).
8. M. Harkavy, J. D. Tygar and H. Kikuchi, “Electronic Auctions with Private Bids”, Proceedings of Third USENIX Workshop on Electronic Commerce, pp. 61–74, (1998).
9. M. Jakobsson and A. Juels, “Mix and Match: Secure Function Evaluation via Ciphertexts”, Proceedings of ASIACRYPT 2000, pp. 162–177, (2000).
10. H. Kikuchi, “(M+1)st-Price Auction Protocol”, Proceedings of Financial Cryptography 2001,, (2001).
11. H. Kikuchi, M. Harkavy and J. D. Tygar, “Multi-round Anonymous Auction Protocols”, Proceedings of first IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62–69, (1998).
12. K. Kobayashi, H. Morita, K. Suzuki and M. Hakuta, “Efficient Sealedbid Auction by using One-way Functions”, IEICE Trans. Fundamentals,, (Jan. 2001).
13. M. Kudo, “Secure Electronic Sealed-Bid Auction Protocol with Public Key Cryptography”, IEICE Trans. Fundamentals, vol. E81-A, no. 1, pp. 20–27, (Jan. 1998).
14. M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design”, Proceedings of ACM conference on E-commerce, pp. 129–139, (1999).
15. K. Omote and A. Myaji, “An Anonymous Auction Protocol with a Single Non-trusted Center Using Binary Trees”, Proceedings of ISW2000, pp. 108–120, (2000).
16. P. Paillier, “Public-Key Cryptosystems Based on Composite Degree Residuosity Classes”, Proceedings of EUROCRYPT’99, pp. 223–238, (1999).
17. K. Sako, “Universally verifiable auction protocol which hides losing bids”, Proceedings of Public Key Cryptography2000, pp. 35–39, (2000).
18. V. Shoup and R. Gennaro, “Securing Threshold Cryptosystems against Chosen Ciphertext Attack”, Proceedings of EUROCRYPT’98, pp. 1–16, (1998).
19. K. Suzuki, K. Kobayashi and H. Morita, “Efficient Sealed-Bid Auction using Hash Chain”, Proceedings of ICISC 2000, LNCS 2015, (2000).
20. K. Sakurai and S. Miyazaki, “A bulletin-board based digital auction scheme with bidding down strategy”, Proceedings of 1999 International Workshop on Cryptographic Techniques and E-Commerce, pp. 180–187, (1999).
21. S. G. Stubblebine and P. F. Syverson, “Fair On-line Auctions Without Special Trusted Parties”, Proceedings of Financial Cryptography 99,, (1999).
22. W. Vickrey, “Counterspeculation, Auctions, and Competitive Sealed Tenders”, Journal of Finance, pp. 8–37, (Mar. 1961).