Benaloh's Dense Probabilistic Encryption Revisited

Details Benaloh's Dense Probabilistic Encryption Revisited Benaloh's Dense Probabilistic Encryption Revisited

2010-08-18

arxiv.org/abs/1008.2991v3

Computer Science

Cryptography and Security

Scientific paper

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, computing multi-party trust privately, non-interactive verifiable secret sharing, online poker... In this paper we show that the original description of the scheme is incorrect, possibly resulting in ambiguous decryption of ciphertexts. We give a corrected description of the scheme and provide a complete proof of correctness. We also compute the probability of failure of the original scheme. Finally we analyze several applications using Benaloh's encryption scheme. We show in each case the impact of a bad choice in the key generation phase of Benaloh's scheme. For instance in the application of e-voting protocol, it can inverse the result of an election, which is a non negligible consequence.

Affiliated with

Also associated with

No associations

Rating

Benaloh's Dense Probabilistic Encryption Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Benaloh's Dense Probabilistic Encryption Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Benaloh's Dense Probabilistic Encryption Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503801