A Shuffling Scheme with Strict and Strong Security

In this paper, it is pointed out that security of no existing shuffling scheme is strong enough for their supposed applications. For example, some of them are not always correct. Especially, their soundness and privacy depend on hardness of certain mathematical problems, and so their security are conditional. It is difficult to persuade the public to believe the assumptions on hardness of the mathematical problems, which even the mathematicians are not sure of. In e-voting, the main application of shuffling, this drawback means that some entities with powerful computation recourses or techniques (e.g. governments, billionaires or mathematical geniuses) can compromise security of the election. A new shuffling scheme is proposed to overcome this drawback and achieve strict and strong security. It is always correct. It achieves soundness in information-theoretic sense. It achieves perfect ZK (zero knowledge) in its privacy. Moreover, achievement of its security is simple and formally provable and does not greatly compromise efficiency.