Abstract
A MIX net takes a list of ciphertexts (c1,…, cN) and out- puts a permuted list of the plaintexts (m1,… , mN) without revealing the relationship between (c1,… , cN) and (m1, … , mN). This paper first shows that the Jakobsson's MIX net of Eurocrypt'98, which was believed to be resilient and very efficient, is broken. We next propose an efficient t-resilient MIX net with O(t2) servers in which the cost of each MIX server is O(N). Two new concepts are introduced, existential-honesty and limited-open-verification. They will be useful for distributed computation in general.
Cite
CITATION STYLE
Desmedt, Y., Desmedt, Y., & Kurosawa, K. (2000). How to break a practical MIX and design a new one. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1807, pp. 557–572). Springer Verlag. https://doi.org/10.1007/3-540-45539-6_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
