It is not known to date how to partially share the factors of an integer (e.g., an RSA modulus) with verifiability. We construct
such a scheme on exploitation of a significantly lowered complexity for factoring n = pq using a non-trivial factor of φ(n).