2010
DOI: 10.1016/j.comcom.2009.11.013
|View full text |Cite
|
Sign up to set email alerts
|

Simple and efficient hash-based verifiable mixing for remote electronic voting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0
1

Year Published

2011
2011
2019
2019

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 26 publications
0
12
0
1
Order By: Relevance
“…In proposals [7,16] a malicious participant is able to send a cryptogram with a non-matching redundancy. The tracing procedure given in [7] has been shown to include some vulnerabilities [17], while in [16] the vote opening phase would have to be interrupted and the whole election be carried out again from zero.…”
Section: The "Proof Of Product With Redundancy" Paradigmmentioning
confidence: 99%
See 4 more Smart Citations
“…In proposals [7,16] a malicious participant is able to send a cryptogram with a non-matching redundancy. The tracing procedure given in [7] has been shown to include some vulnerabilities [17], while in [16] the vote opening phase would have to be interrupted and the whole election be carried out again from zero.…”
Section: The "Proof Of Product With Redundancy" Paradigmmentioning
confidence: 99%
“…The tracing procedure given in [7] has been shown to include some vulnerabilities [17], while in [16] the vote opening phase would have to be interrupted and the whole election be carried out again from zero. In [17] some more vulnerabilities of [7] involving dishonest mixing elements are described.…”
Section: The "Proof Of Product With Redundancy" Paradigmmentioning
confidence: 99%
See 3 more Smart Citations