Abstract
Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid auction with bid privacy. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Peng, K., Boyd, C., & Dawson, E. (2005). A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3650 LNCS, pp. 374–388). Springer Verlag. https://doi.org/10.1007/11556992_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
