Decisional composite residuosity assumption
The decisional composite residuosity assumption is a mathematical assumption used in cryptography. In particular, the assumption is used in the proof of the Paillier cryptosystem.
Informally, the DCRA states that given a composite and an integer, it is hard to decide whether is an -residue modulo. I.e. whether there exists a such that