2011/01/28 by Kun Peng
Computer Science · Mathematics · #Algorithm #Computer science #Computer security #Correctness #Cryptographic Implementations and Security #Cryptography and Data Security #Internet Traffic Analysis and Secure E-voting #Mathematics #Programming language #Protocol (science) #Scheme (mathematics) #Shuffling #Soundness #Theoretical computer science #acm:68 #cs.CR #msc:68
paper · pdf · doi:10.5121/ijnsa.2011.3106
published as International Journal of Network Security and Its Applications (IJNSA), Vol.3, No.1, January 2011
arxiv created 2011/01/28 · openalex publication_date 2011/01/28 · arxiv updated 2011/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.