Providing Receipt-Freeness in Mixnet-Based Voting Protocols

@inproceedings{Lee2003ProvidingRI,
  title={Providing Receipt-Freeness in Mixnet-Based Voting Protocols},
  author={Byoungcheon Lee and Colin Boyd and Ed Dawson and Kwangjo Kim and Jeongmo Yang and Seungjae Yoo},
  booktitle={ICISC},
  year={2003}
}
It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct a receipt, since a user can prove to a buyer how he had encrypted the ballot. In this paper we propose a simple and efficient method to incorporate receipt-freeness in mixnetbased electronic voting schemes by using the well known re-encryption technique and designated verifier re-encryption proof (DVRP). In our scheme a voter… CONTINUE READING
Highly Cited
This paper has 138 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 87 extracted citations

Attacking and fixing Helios: An analysis of ballot secrecy

Journal of Computer Security • 2013
View 5 Excerpts
Highly Influenced

Electronic voting - Scopes and limitations

2012 International Conference on Informatics, Electronics & Vision (ICIEV) • 2012
View 7 Excerpts
Highly Influenced

A formal taxonomy of privacy in voting protocols

2012 IEEE International Conference on Communications (ICC) • 2012
View 5 Excerpts
Highly Influenced

Remote Electronic Voting with Revocable Anonymity

ICISS • 2009
View 6 Excerpts
Highly Influenced

138 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 138 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

A Verifiable Secret Shuffle of Homomorphic Encryptions

Public Key Cryptography • 2003
View 5 Excerpts
Highly Influenced

A verifiable secret shuffle and its application to e-voting

ACM Conference on Computer and Communications Security • 2001
View 5 Excerpts
Highly Influenced

An Efficient Scheme for Proving a Shuffle

CRYPTO • 2001
View 5 Excerpts
Highly Influenced

Mix-networks in permutation networks

M. Abe
Asiacrypt 1999, LNCS 1716, Springer-Verlag, pp. 258–273 • 1999
View 4 Excerpts
Highly Influenced

How to break

D. Wikstrom
fix, and optimize optimistic mix for exit-polls”, SICS Technical Report, T2002:24, available at http://www.sics.se/libindex.html • 2002

Similar Papers

Loading similar papers…