The Primitive beyond Voting Schemes
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | MEMICS 2006, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science |
| MU Faculty or unit | |
| Citation | |
| Web | MEMICS '06 site |
| Field | Informatics |
| Keywords | cryptographic protocols; voting; modularity; cryptographic primitives |
| Description | We analyze the three famous ideas voting schemes are based on. We show that all voting schemes are based on the same cryptographic primitive called an anonymous channel. We present two types of anonymous channels that can be used to design voting schemes. Examples of two illustrative voting schemes are presented as well. These examples serve as illustration of some properties of all voting schemes. We use modular approach to design these schemes. |
| Related projects: |