Receipt-free electronic auction schemes using homomorphic encryption

28Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bid-rigging is a dangerous attack in electronic auction. Abe and Suzuki firstly introduced the idea of receipt-free to prevent this attack. In this paper we point out that Abe and Suzuki's scheme only provides receipt-freeness for losing bidders. We argue that it is more important to provide receipt-freeness for winners and propose a new receipt-free sealed bid auction scheme using the homomorphic encryption technique. In contrast to Abe and Suzuki's scheme, our scheme satisfies privacy, correctness, public verifiability and receipt-freeness for all bidders. Also, our scheme is not based on threshold trust model but three-party trust model, so it is more suitable for real-life auction. Furthermore, we extend our scheme to M + 1-st price receipt-free auction. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Chen, X., Lee, B., & Kim, K. (2004). Receipt-free electronic auction schemes using homomorphic encryption. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2971, 259–273. https://doi.org/10.1007/978-3-540-24691-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free