Attack for Flash MIX

A MIX 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.

• Type: Conference
• Year: 2000
• Where: ASIACRYPT
• Authors: Masashi Mitomo, Kaoru Kurosawa
• Keywords: ASIACRYPT 2000, Cryptology, Jakobsson’s flash Mix, MIX Net, Robust Mix Net