Abstract
AMIX net takes a list of ciphertexts (c1,…, cN) and outputs a permuted list of the plaintexts (m1,…, mN) without revealing the relationship between (c1,…, cN) and (m1,…, mN). This paper shows that the Jakobsson’s flash MIX of PODC’99, which was believed to be the most efficient robust MIX net, is broken. The first MIX server can prevent computing the correct output with probability 1 in our attack. We also present a countermeasure for our attack.
Cite
CITATION STYLE
Mitomo, M., & Kurosawa, K. (2000). Attack for flash MIX. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1976, pp. 192–204). Springer Verlag. https://doi.org/10.1007/3-540-44448-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
