In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not ne...In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.展开更多
This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cr...This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to Elgamal method. It is more flexible when compared to previous schemes. We also propose data packing for efficient storage of election data. Finally, we demonstrate the advantages of the homomorphic encryption in voting schemes by comparing with other electronic voting scheme.展开更多
Privacy is an important issue in electronic voting. The concept of ＇full privacy＇ in electronic voting was firstly proposed, not only the privacy of voters is concerned, but also the candidates＇. Privacy preserving...Privacy is an important issue in electronic voting. The concept of ＇full privacy＇ in electronic voting was firstly proposed, not only the privacy of voters is concerned, but also the candidates＇. Privacy preserving electronic election architecture without any trusted third party is presented and a general technique for k-out-of-m election based on distributed E1Gamal encryption and mix-match is also provided. The voters can compute the result by themselves without disclosing their will and the vote of the losing candidates. Moreover, whether the vote of winner candidate is more than a half can be verified directly. This scheme satisfies ＇vote and go＇ pattern and achieves full privacy. The correctness and security are also analyzed.展开更多
基金Supported by the National Natural Science Foun-dation of China (60572155) the National Nature Science Founda-tion of China for Distinguished Young Scholars (60225007)
文摘In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.
文摘This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to Elgamal method. It is more flexible when compared to previous schemes. We also propose data packing for efficient storage of election data. Finally, we demonstrate the advantages of the homomorphic encryption in voting schemes by comparing with other electronic voting scheme.
基金supported by the National Natural Science Foundation of China (61121061)China High Technology Development Project (NDRC)
文摘Privacy is an important issue in electronic voting. The concept of ＇full privacy＇ in electronic voting was firstly proposed, not only the privacy of voters is concerned, but also the candidates＇. Privacy preserving electronic election architecture without any trusted third party is presented and a general technique for k-out-of-m election based on distributed E1Gamal encryption and mix-match is also provided. The voters can compute the result by themselves without disclosing their will and the vote of the losing candidates. Moreover, whether the vote of winner candidate is more than a half can be verified directly. This scheme satisfies ＇vote and go＇ pattern and achieves full privacy. The correctness and security are also analyzed.
