 Like Paillier, the security of Damgård–Jurik can be proven under the decisional composite residuosity assumption.At the cost of no longer containing the classical Paillier cryptosystem as an instance, Damgård–Jurik can be simplified in the following way