%0 Conference Proceedings
%T Multiplicative Homomorphic E-Auction with Formally Provable Security
%+ Institute for Infocomm Research - I²R [Singapore]
%A Peng, Kun
%A Henricksen, Matt
%Z Part 1: Cryptography and Cryptanalysis
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 7th International Workshop on Information Security THeory and Practice (WISTP)
%C Heraklion, Greece
%Y Lorenzo Cavallaro
%Y Dieter Gollmann
%I Springer
%3 Information Security Theory and Practice. Security of Mobile and Cyber-Physical Systems
%V LNCS-7886
%P 1-17
%8 2013-05-28
%D 2013
%R 10.1007/978-3-642-38530-8_1
%Z Computer Science [cs]Conference papers
%X 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).
%G English
%Z TC 11
%Z WG 11.2
%2 https://inria.hal.science/hal-01485930/document
%2 https://inria.hal.science/hal-01485930/file/978-3-642-38530-8_1_Chapter.pdf
%L hal-01485930
%U https://inria.hal.science/hal-01485930
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-7886