Multi-Autority Secret-Ballot Elections with Linear Work

@inproceedings{Cramer1996MultiAutoritySE,
  title={Multi-Autority Secret-Ballot Elections with Linear Work},
  author={Ronald Cramer and Matthew K. Franklin and Berry Schoenmakers and Moti Yung},
  booktitle={International Conference on the Theory and Application of Cryptographic Techniques},
  year={1996},
  url={https://api.semanticscholar.org/CorpusID:7679794}
}
Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damgard and Schoenmakers, and the verifiable secret sharing scheme of Pedersen, reduce the work required by the voter or an authority to a linear number of cryptographic operations in the population size.
View via Publisher
link.springer.com
397 Citations
Highly Influential Citations
15
Background Citations
112
Methods Citations
64
Results Citations
4

397 Citations

Boardroom Voting Scheme with Unconditionally Secret Ballots Based on DC-Net

A novel electronic voting scheme is proposed which is quite suitable for small scale election settings and guarantee of unconditionally perfect ballot secrecy, built on top of the DC-net(dining cryptographers network) anonymous broadcast protocol.

Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots

We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints…

Practical multi-candidate election system

A practical multi-candidate election scheme that guarantees privacy of voters, public verifiability, and robustness against a coalition of malicious authorities is described, based on the Paillier cryptosystem and on some related zero-knowledge proof techniques.

Efficient mixing of arbitrary ballots with everlasting privacy: How to verifiably mix the PPATC scheme

This work gives a paper proof, and a machine checked proof, that the variant of Wikström’s mixnet commonly in use is safe for use with the PPATC encryption scheme.

Anonymous One-Time Broadcast Using Non-interactive Dining Cryptographer Nets with Applications to Voting

    J. Graaf
    Computer Science
    Towards Trustworthy Elections
  • 2010
This paper outlines a new and conceptually simple approach allowing us to construct a protocol in which the privacy of the ballot is unconditional, and uses a new broadcast protocol for anonymously publishing the vote, a Non-Interactive variation of the Dining Cryptographer Net.

Fully auditable electronic secret-ballot elections

This paper shows how special-purpose cryptographic protocols help to achieve the goal of guaranteeing voters’ privacy and integrity of the election result at the same time.

A secure approach to election scheme based on Naccache Stern Knapsack Cryptosystem

Naccache Stern Knapsack Cryptosystem is proposed to provide security and privacy for the election and ensures that the election is completely correct.

Cronus: Everlasting Privacy with Audit and Cast

This work presents a new online voting scheme with everlasting privacy and cast-as-intended verifiability, and provides measures for avoiding coercion by allowing any party to create fake proofs for the content of any vote.

A Multiauthority Electronic Voting Protocol Based upon a Blind Multisignature Scheme

A blind multisignature scheme based on an extension of the RSA cryptosystem (called the ERSA system) is proposed, which can meet all of the following requirements: eligibility, collision free, vigorousness of authorities, accuracy, privacy, verifiability, robustness, fairness, and prevention of ticket-buying or extortion.

A practical election scheme using the Guy Fawkes protocol and paired chaining publication

This scheme aims at low computational load, high voter’s privacy, untraceability of voters and universal verifiability of ballots, and achieves low complexity and resource consumption.
...

23 References

Verifiable secret-ballot elections

This thesis describes a practical scheme for conducting secret-ballot elections in which the outcome of an election is verifiable by all participants and even by non-participating observers.

Receipt-free secret-ballot elections (extended abstract)

This paper presents the first verifiable secret-ballot election protocols in which participants are unable to prove to others how they voted, and describes how this defect is embedded within prior election protocols.

A robust and verifiable cryptographically secure election scheme

A cryptographic scheme for holding a secure secret ballot election in which all communication is public is described, which introduces a new form of "interactive proof" by which one participant gives passive observers high confidence that certain claims are true without releasing related private information.

Achieving Independence Eeciently and Securely

A constant round protocol to perform independence or simultaneous broadcast under general complexity assumptions is presented and a new and stronger formal deenition for this problem is developed.

Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these…

Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth

This work presents a receipt-free voting scheme based on a mixtype anonymous channel, where the sole physical assumption is the existence of a private channel through which the center can send the voter a message without fear of eavesdropping.

Secure Voting Using Partially Compatible Homomorphisms

We introduce a new number-theoretic based protocol for secure electronic voting. Our scheme is much more communication efficient than previous schemes of its type, and has a much lower round…

Achieving independence efficiently and securely

A constant round protocol to perform independence or simultaneous broadcast under general complexity assumptions is presented and a new and stronger formal definition for this problem is developed.

Distributing the power of a government to enhance the privacy of voters

In this paper, we distribute the functions of the government in the cryptographic election scheme of [CoFi85]. In so doing, we are able to achieve privacy of individual votes in a much stronger sense…

Witness Hiding Proofs and Applications

It is proved, in this thesis, that with limited computational power, it is impossible to divert a witness hiding protocol parallelly to two independent verifiers with large probability.