We show how to prove in honest verifier zero-knowledge the correctness of a shuffe of homomorphic encryptions (or homomorphic commitments.) A shuffe consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed. Our scheme is more efficient than previous schemes both in terms of communication complexity and computational complexity. Indeed, in the case of shuffling ElGamal encryptions, the proof of correctness is smaller than the encryptions themselves.