
{"publication_number": "US-5495532-A", "abstract": "a number - theoretic based algorithm provides for secure electronic voting . a voter may cast a votes among n centers in a manner which prevents fraud and authenticates the votes . preprocessing allows for nearly all of the communication and computation to be performed before any voting takes place . each center can verify that each vote has been properly counted . the algorithm is based on families of homomorphic encryptions which have a partial compatibility property . the invention can be realized by current - generation pcs with access to an electronic bulletin board .", "application_number": "US-29336394-A", "description": "the basic voting scheme comprising the present invention will now be described . for simplicity , assume that there are only two centers counting the votes , and that a single yes / no vote is being held . it will be apparent to those skilled in the art that the invention is applicable to situations with many , for example tens , vote counting centers . the basic method does not protect privacy of a vote against the center . this problem will be overcome as described below when more than two centers are involved . the two centers are denoted by c 1 and c 2 . each vote v will be broken into shares x 1 and x 2 , where x i is a member of z q , and q is a prime . before being posted , each share x i is encrypted using encryption function e i , where { e i , e 2 