2015
DOI: 10.1007/s10270-015-0474-0
|View full text |Cite
|
Sign up to set email alerts
|

Constructing and verifying a robust Mix Net using CSP

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
0
0
0
Order By: Relevance
“…Nevertheless, the solutions take a substantial computational effort for every user and predefined periods are compulsory for every round of votes. Protocols that do not need mixnets [7] tend to incorporate homomorphic encryption instead [8,9], but this property implies a predefined and established ballot, resulting in inflexible systems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Nevertheless, the solutions take a substantial computational effort for every user and predefined periods are compulsory for every round of votes. Protocols that do not need mixnets [7] tend to incorporate homomorphic encryption instead [8,9], but this property implies a predefined and established ballot, resulting in inflexible systems.…”
Section: Introductionmentioning
confidence: 99%
“…Mixnets [6,7]: Mixnets are devices that receive a list of encrypted messages which are then shuffled and decrypted. Here, security depends on trusting in at least one node of the mixnet.…”
mentioning
confidence: 99%