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


Autoria(s): Boyd, Colin; Dawson, Edward; Peng, Kun
Contribuinte(s)

J, Zhou

J, Lopez

et al, Deng

Data(s)

2005

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/23903/

Publicador

Springer Berlin Heidelberg

Relação

http://eprints.qut.edu.au/23903/1/A_multiplicative_homomorphic_sealed-bid_auction-based_on_Goldwasser-Micali_Encryption.pdf

DOI:10.1007/11556992_27

Boyd, Colin, Dawson, Edward, & Peng, Kun (2005) A Multiplicative Homomorphic Sealed-Bid Auction-Based on Goldwasser-Micali Encryption. Lecture Notes in Computer Science- Information security, 3650, pp. 374-388.

Fonte

Faculty of Science and Technology; Information Security Institute

Palavras-Chave #080402 Data Encryption #080499 Data Format not elsewhere classified #150399 Business and Management not elsewhere classified #Secure Actions, Homomorphic Encryption, Electronic Commerce
Tipo

Journal Article