Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Privacy-preserving collaborative data mining
Privacy-preserving collaborative data mining
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
The security analysis of e-voting in Japan
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Practical voting rules with partial information
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We propose a cooperative multi-party system where unrelated entities can both both vote and change their vote with continual accurate tabulation results while retaining vote privacy. The voting protocol presented uses homomorphic encryption, digital envelopes, Hamming weights, multiple parties to fulfill the needs of an e-voting system. The protocol is presented and limitations are explored.