Multiplicative Homomorphic E-Auction with Formally Provable Security [chapter]

Kun Peng, Matt Henricksen
2013 Lecture Notes in Computer Science  
A new method, homomorphic e-auction based on multiplicative homomorphic encryption algorithm like ElGamal encryption is proposed in this paper. Its advantage is obvious and useful in practice: efficient distributed private key generation and thus efficient trust sharing. A long existing problem in homomorphic e-auction, inefficiency of bid validity check, is solved in the new multiplicative homomorphic eauction scheme in this paper, which employs efficient bid re-formatting to enforce bid
more » ... ty. Another contribution of the new multiplicative homomorphic e-auction scheme is that it is the first e-auction scheme to provide formal and comprehensive security analysis to achieve formally provable security (especially privacy).
doi:10.1007/978-3-642-38530-8_1 fatcat:3cymq2zvtjdrfgx4rmbsh6fe7u