Implementation Of Paillier Cryptosystem Based Non-interactive Shuffle Scheme

It is of much importance to protect information against attacks during the process ofInternet and communication. To solve the problem better, a multitude of scholars putforward and design all kinds of cryptography schemes. Just under the background, akind of verifiable Shuffle Theory which is based on a mathematical construct come withthe tide.Early in2001, verifiable Shuffle Theory was referred by C.Andrew Neff in order tostudy e-voting systems. A shuffle is a permutation and rerandomization of a se t ofciphertexts. An application to e-voting could assure privacy and anonymity of theidentity of the voters. In the following dacades, a variety of schemes of S huffle havecome out. Most of these schemes are based on homomorphic encryption, such asElgamal encryption and Paillier’s encryption. These schemes tend to use multi-roundinteractive zero-knowledge protocols, which can make sure that the prover could bebelieved that he owns the corresponding permutation matrix, meanwhile not leak hisown private information. Verifiable Shuffle consists of interactive Shuffle andnon-interactive Shuffle. Interactive Shuffle is based upon commit-challenge-responsesystem, and it holds online verification. However, non-interactive Shuffle is verifieddirectly by verifier at the receive end. It is unnecessary for party to work online, on thecontrary, it backs up offline verification. Compared with interactive Shuffle,non-interactive Shuffle carries a lower round complexity.Therefore, based on offline verification, this paper gradually finds problems, analyzesproblems, solve problems and finally draws conclusions This paper transforms aninteractive Shuffle Scheme based on Paillier Encryption referred by Takao into anon-interactive Shuffle signature protocol. Not only does it offer a rigorous mathematic proof in completeness, soundness and zero-knowledge, but also it carries a simulation inthe environment of VC software at offline verification n e-voting.The research of Shuffle not only provides a completely new train of thought in thefield of e-commerce, but also permeates into many other fields, such as communication,internet and so forth. Nevertheless, the key systems and algorithm are far fromperfection, especially in algorithm complexity, which draws many scholars’ highattention in the field of information security throughout the world.