Anzeige
Erschienen in:
2002 | OriginalPaper | Buchkapitel
A Verifiable Secret Shuffe of Homomorphic Encryptions
verfasst von : Jens Groth
Erschienen in: Public Key Cryptography — PKC 2003
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.