Failure of A Mix Network
Kun Peng
Abstract
Open-access reader
Kun Peng
Abstract
Open-access reader
A mix network by Wikstrom fails in correctness, provable privacy and soundness.Its claimed advantages in security and efficiency are compromised.The analysis in this paper illustrates that although the first two failures may be fixed by modifying the shuffling protocol, the last one is too serious to fix at a tolerable cost.Especially, an attack is proposed to show how easily soundness of the shuffling scheme can be compromised.Moreover, the most surprising discovery in this paper is that it is formally illustrated that in practice it is impossible to fix soundness of the shuffling scheme by Wikstrom.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A mix network by Wikstrom fails in correctness, provable privacy and soundness.Its claimed advantages in security and efficiency are compromised.The analysis in this paper illustrates that although the first two failures may be fixed by modifying the shuffling protocol, the last one is too serious to fix at a tolerable cost.Especially, an attack is proposed to show how easily soundness of the shuffling scheme can be compromised.Moreover, the most surprising discovery in this paper is that it is formally illustrated that in practice it is impossible to fix soundness of the shuffling scheme by Wikstrom.
Key concepts: Shuffling, Soundness, Correctness, Computer science, Scheme (mathematics), Protocol (science), Computer security, Theoretical computer science