WRSWorld Research StateContribute
WORLD RESEARCH STATE

Paillier: add messages while keeping them encrypted

Contribution grade

Computer science · Computer science

Reference score220,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Composite-residuosity classes provide a factorization trapdoor for probabilistic public-key encryption whose ciphertext multiplication implements plaintext addition modulo n, with explicit computational and decisional security assumptions.

Scientific scope

Composite-residuosity classes provide a factorization trapdoor for probabilistic public-key encryption whose ciphertext multiplication implements plaintext addition modulo n, with explicit computational and decisional security assumptions. The basic scheme encrypts messages in Z_n using an admissible base, fresh random units and the stated RSA-like modulus conditions. Its additive homomorphism acts modulo n; it is not fully homomorphic encryption. One-wayness and semantic security use different composite-residuosity assumptions; the paper does not supply general chosen-ciphertext security. Fast variants, indicative timing tables and the trapdoor-permutation construction are separate subclaims. WRS has not independently reconstructed every reduction or measured the implementation.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction