No abstract

No abstract

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.

Online Social Networks(OSNs) have mutual themes such as information sharing, person-to-person interaction and creation of shared and collaborative content. Lots of micro blogging websites available like Twitter, Instagram, Tumblr. A standout amongst the most prominent online networking stages is Twitter. It has 313 million months to month dynamic clients which post of 500 million tweets for each day. Twitter allows users to send short text based messages with up to 140-character letters called "tweets". Enlisted clients can read and post tweets however the individuals who are unregistered can just read them. Due to the reputation it attracts the consideration of spammers for their vindictive points, for example, phishing true blue clients or spreading malevolent programming and promotes through URLs shared inside tweets, forcefully take after/unfollow valid clients and commandeer drifting subjects to draw in their consideration, proliferating obscenity. Twitter Spam has become a critical problem nowadays. By looking at the execution of an extensive variety of standard machine learning calculations, fundamentally expecting to distinguish the acceptable location execution in light of a lot of information by utilizing account-based and tweet content-based highlights.

No abstract