Benaloh's dense probabilistic encryption revisited - CASYS Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Benaloh's dense probabilistic encryption revisited

Résumé

In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous papers have taken advantage of Benaloh's homomorphic encryption function, including voting schemes, private multi-party trust computation, non-interactive verifiable secret sharing, online poker. In this paper we show that the original description of the scheme is incorrect, because it can result in ambiguous decryption of ciphertexts. Then we show on several applications that a bad choice in the key generation phase of Benaloh's scheme has a real impact on the behaviour of the application. For instance in an e-voting protocol, it can inverse the result of an election. Our main contribution is a corrected description of the scheme (we provide a complete proof of correctness). Moreover we also compute the probability of failure of the original scheme. Finally we show how to formulate the security of the corrected scheme in a generic setting suitable for several homomorphic encryptions.
Fichier principal
Vignette du fichier
FLA11.pdf (321.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00769449 , version 1 (13-12-2017)

Identifiants

  • HAL Id : hal-00769449 , version 1

Citer

Laurent Fousse, Pascal Lafourcade, Mohamed Alnuaimi. Benaloh's dense probabilistic encryption revisited. AFRICACRYPT'11 - 4th international conference on Progress in cryptology in Africa, Jul 2011, Dakar, Senegal. pp.348-362. ⟨hal-00769449⟩
187 Consultations
137 Téléchargements

Partager

Gmail Facebook X LinkedIn More