Skip to Main content Skip to Navigation
Conference papers

Multiplicative Homomorphic E-Auction with Formally Provable Security

Abstract : 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 e-auction scheme in this paper, which employs efficient bid re-formatting to enforce bid validity. 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).
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01485930
Contributor : Hal Ifip <>
Submitted on : Thursday, March 9, 2017 - 3:16:08 PM
Last modification on : Thursday, March 9, 2017 - 3:21:21 PM
Long-term archiving on: : Saturday, June 10, 2017 - 2:37:45 PM

File

978-3-642-38530-8_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Kun Peng, Matt Henricksen. Multiplicative Homomorphic E-Auction with Formally Provable Security. 7th International Workshop on Information Security THeory and Practice (WISTP), May 2013, Heraklion, Greece. pp.1-17, ⟨10.1007/978-3-642-38530-8_1⟩. ⟨hal-01485930⟩

Share

Metrics

Record views

120

Files downloads

269