# Computing/using RSA modulus without knowing its factors

There are some protocols, e.g. this, that require parties to compute/use RSA modulus: $$N$$ without knowing it's factors or $$\phi(N)$$.

One way of doing it is to use a trusted party.

Question: Is there any other way of generating/using $$N$$ in the above schemes without using a trusted party? (If yes, can you refer me to some papers)