Robust, privacy protecting and publicly verifiable sealed-bid auction

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

Abstract

The sealed bid model of auctions is ideally suited for electronic auction systems, as they avoid the requirement for real-time communications between various entities. A sealed bid auction scheme designed by Kikuchi, Harkavy and Tygar is analysed. Several shortcomings are identified in this scheme including the lack of public verifiability and the possibility of collusion between bidders and/or auctioneers. A new scheme is designed to overcome these shortcomings.

Cite

CITATION STYLE

APA

Peng, K., Boyd, C., Dawson, E., & Viswanathan, K. (2002). Robust, privacy protecting and publicly verifiable sealed-bid auction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2513, pp. 147–159). Springer Verlag. https://doi.org/10.1007/3-540-36159-6_13

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