A shuffle to achieve high efficiency through pre-computation and batch verification

Abe, M.: Mix-networks on permutation net-works. In: ASIACRYPT ’98. Lecture Notes in Computer Science, vol. 1716, pp. 258–273 (1999)

Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Public Key Cryptography 2001. Lecture Notes in Computer Science, vol. 1992, pp. 317–324 (2001)

Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. HEHCC (2005)

Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: FC ’00. Lecture Notes in Computer Science, vol. 1962, pp. 90–104 (2000)

Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: CRYPTO ’01, Lecture Notes in Computer Science, vol. 2139, pp. 368–387 (2001)

Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. In: IEICE, Transactions vol. 88-A, No. (1), pp. 172–188 (2005)

Groth, J., Ishai, Y.: Sub-linear zero-knowledge argument for correctness of a shuffle. In: EUROCRYPT ’08. Lecture Notes in Computer Science, vol. 4965, pp. 379–396 (2008)

Groth, J., Lu, S.: Verifiable shuffle of large size ciphertexts. In PKC ’07. Lecture Notes in Computer Science, vol. 4450, pp. 377–392 (2007)

Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. Cryptol. 23(4), 546–579 (2010)

Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications, Security, pp. 116–125 (2001)

Neff, C.: Verifiable mixing (shuffling) of ElGamal pairs (2004). Available as http://theory.lcs.mit.edu/rivest/voting/papers/Neff-2004-04-21-ElGamalShuffles.pdf

Nguyen, L., Safavi-Naini, R, Kurosawa, K.: Verifiable shuffles: a formal model and a paillier-based efficient construction with provable security. In: ACNS 2004, pp. 61–75 (2004)

Nguyen, L., Safavi-Naini, R., Kurosawa, K.: A provably secure and effcient verifiable shuffle based on a variant of the paillier cryptosystem. J. Univers. Comput. Sci. 11(6), 986–1010 (2005)

Peng, K., Dawson, E., Bao, F.: Modification and optimisation of a shuffle scheme: stronger security, formal analysis and higher efficiency. Int. J. Inf. Secur. 10(1), 33–47 (2011)

Peng, K., Boyd, C., Dawson, E.: Simple and efficient shuffling with provable correctness and ZK privacy. In: CRYPTO ’05, Lecture Notes in Computer Science, vol. 3089, pp. 188–204 (2005)

Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: A correct, private and efficient mix network. In: PKC ’04. Lecture Notes in Computer Science, vol. 2947, pp. 439–454 (2004)

Peng, Kun, Boyd, Colin: Batch zero knowledge proof and verification and its applications. In: ACM TISSEC 10(2), Article No. 6 (2007, May)

Wikstrom, D.: A sender verifiable mix-net and a new proof of a shuffle. In: ASIACRYPT ’05, Lecture Notes in Computer Science, vol. 3788, pp. 273–292 (2005)