Abstract
This paper provides a M + 1-st price auction scheme using homomorphic encryption and the mix and match technique; it offers secrecy of bidding price and public verifiability. Our scheme has low round communication complexity: 1 round from each bidder to auctioneer in bidding and log p rounds from auctioneer to trusted authority in opening when prices are selected from p prefixed choices.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
M. Abe, “Mix-Networks on Permutation Networks”, Proceedings of ASIACRYPT’ 99, pp. 317–324, (1999).
M. Abe and F. Hoshino, “Remarks on Mix-network based on Permutation Network”, Proceedings of PKC 2001, pp. 317–324, (2001).
O. Baudron and J. Stern, “Non-interactive Private Auctions”, Proceedings of Financial Cryptography 2001, (2001).
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).
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).
K. Chida, K. Kobayashi and H. Morita, “Efficient Sealed-bid Auctions for Massive Numbers of Bidders with Lump Comparison”, Proceedings of ISC’ 01, (2001).
D. L. Chaum and T. P. Pedersen, “Wallet Databases with Observers”, Proceedings of CRYPTO’ 92, pp. 89–105, (1992).
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).
M. Jakobsson and A. Juels, “Mix and Match: Secure Function Evaluation via Ciphertexts”, Proceedings of ASIACRYPT 2000, pp. 162–177, (2000).
H. Kikuchi, “(M+1)st-Price Auction Protocol”, Proceedings of Financial Cryptography 2001, (2001).
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).
K. Kobayashi, H. Morita, K. Suzuki and M. Hakuta, “Efficient Sealed bid Auction by using One-way Functions”, IEICE Trans. Fundamentals, (Jan. 2001).
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).
M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design”, Proceedings of ACM conference on E-commerce, pp. 129–139, (1999).
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).
P. Paillier, “Public-Key Cryptosystems Based on Composite Degree Residuosity Classes”, Proceedings of EUROCRYPT’ 99, pp. 223–238, (1999).
K. Sako, “Universally verifiable auction protocol which hides losing bids”, Proceedings of Public Key Cryptography 2000, pp. 35–39, (2000).
V. Shoup and R. Gennaro, “Securing Threshold Cryptosystems against Chosen Ciphertext Attack”, Proceedings of EUROCRYPT’ 98, pp. 1–16, (1998).
K. Suzuki, K. Kobayashi and H. Morita, “Efficient Sealed-Bid Auction using Hash Chain”, Proceedings of ICISC 2000, LNCS 2015, (2000).
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).
S. G. Stubblebine and P. F. Syverson, “Fair On-line Auctions Without Special Trusted Parties”, Proceedings of Financial Cryptography 99, (1999).
W. Vickrey, “Counterspeculation, Auctions, and Competitive Sealed Tenders”, Journal of Finance, pp. 8–37, (Mar. 1961).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abe, M., Suzuki, K. (2002). M + 1-st Price Auction Using Homomorphic Encryption. In: Naccache, D., Paillier, P. (eds) Public Key Cryptography. PKC 2002. Lecture Notes in Computer Science, vol 2274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45664-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-45664-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43168-8
Online ISBN: 978-3-540-45664-3
eBook Packages: Springer Book Archive