Package paillierp.zkp

Provides the structures and methods to produce non-interactive Zero Knowledge Proofs of encryption, decryption, and multiplication in the generalized Paillier Encryption scheme.

See:
Description

Class Summary

DecryptionZKP	A non-interactive Zero Knowledge Proof that some partial decryption was done.
EncryptionZKP	A non-interactive Zero Knowledge Proof that the ciphertext is of a known message.
MultiplicationZKP	A non-interactive Zero Knowledge Proof that the multiplication of a ciphertext is done.
ZKP	An abstract class for non-interactive Zero Knowledge Proofs.

Package paillierp.zkp Description

Provides the structures and methods to produce non-interactive Zero Knowledge Proofs of encryption, decryption, and multiplication in the generalized Paillier Encryption scheme. These Zero Knowledge Proofs use the Fiat-Shamir heuristic and a hash function to make the protocol non-interactive. The Zero Knowledge Proofs provided are

• Encryption of a message m and random number r.
• Multiplication of the message m in an encryption E(m, r) by a constant α to produce E(αm, r').
• Partial Decryption of a ciphertext c to the partial decryption c_i. (Threshold scheme, only.)

Primary Papers

• A Generalization of Paillier's Public-Key System with Applications to Electronic Voting by Damgård, Jurik, and Nielsen, 2000. This was used for the partial decryption proof.
• Multiparty Computation from Threshold Homomorphic Encryption by Cramer, Damgård, and Nielsen, 2000. This was used for the multiplication and encryption proofs.