Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking

@inproceedings{Jakobsson2002MakingMN,
  title={Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking},
  author={Markus Jakobsson and Ari Juels and Ronald L. Rivest},
  booktitle={IACR Cryptology ePrint Archive},
  year={2002}
}
We propose a new technique for making mix nets robust, called randomized partial checking (RPC). The basic idea is that rather than providing a proof of completely correct operation, each server provides strong evidence of its correct operation by revealing a pseudo-randomly selected subset of its input/output relations. Randomized partial checking is exceptionally efficient compared to previous proposals for providing robustness; the evidence provided at each layer is shorter than the output… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 450 citations. REVIEW CITATIONS

Citations

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

Security Analysis of Re-Encryption RPC Mix Nets

2016 IEEE European Symposium on Security and Privacy (EuroS&P) • 2015
View 7 Excerpts
Highly Influenced

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking

2014 IEEE Symposium on Security and Privacy • 2014
View 9 Excerpts
Highly Influenced

A Publicly-Veri able Mix-net with Everlasting Privacy Towards Observers

IACR Cryptology ePrint Archive • 2012
View 4 Excerpts
Highly Influenced

Randomized Partial Checking Revisited

IACR Cryptology ePrint Archive • 2012
View 7 Excerpts
Highly Influenced

An efficient shuffling based eVoting scheme

Journal of Systems and Software • 2011
View 6 Excerpts
Highly Influenced

PrÊt À Voter: a Voter-Verifiable Voting System

IEEE Transactions on Information Forensics and Security • 2009
View 7 Excerpts
Highly Influenced

450 Citations

02040'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 450 citations based on the available data.

See our FAQ for additional information.

References

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

A Length-Invariant Hybrid Mix

ASIACRYPT • 2000
View 5 Excerpts
Highly Influenced

How to Break a Practical MIX and Design a New One

EUROCRYPT • 2000
View 4 Excerpts
Highly Influenced

Optimal Asymmetric Encryption

EUROCRYPT • 1994
View 3 Excerpts
Highly Influenced

A verifiable secret shuffle and its application to e-voting

ACM Conference on Computer and Communications Security • 2001
View 1 Excerpt

Non - malleable cryptography An efficient scheme for proving a shuffle

K. Nyberg
EUROCRYPT ’ 98 , volume 1403 of Lecture Notes in Computer Science • 2001

Attack for Flash MIX

ASIACRYPT • 2000
View 3 Excerpts

Non-Malleable Cryptography

Danny, Dolevy, +3 authors NaorxMar
2000
View 1 Excerpt

Similar Papers

Loading similar papers…