Multiplicative Homomorphic E-Auction with Formally Provable Security - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Multiplicative Homomorphic E-Auction with Formally Provable Security

Résumé

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).
Fichier principal
Vignette du fichier
978-3-642-38530-8_1_Chapter.pdf (281.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01485930 , version 1 (09-03-2017)

Licence

Paternité

Identifiants

Citer

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⟩
61 Consultations
75 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More