A Multiplicative Homomorphic Sealed-Bid Auction Based on Goldwasser-Micali Encryption | Zendy

Kun Peng | Zendy; Colin Boyd | Zendy; Ed Dawson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Multiplicative Homomorphic Sealed-Bid Auction Based on Goldwasser-Micali Encryption

Author(s) -

Kun Peng,

Colin Boyd,

Ed Dawson

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29001-X

DOI - 10.1007/11556992_27

Subject(s) - computer science , homomorphic encryption , homomorphism , encryption , multiplicative function , theoretical computer science , computer security , mathematics , discrete mathematics , mathematical analysis

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research