To extend this to a t of n case they must make sure that each and all of the possible subsets of t signers hold the same multiplicative secret. I can see how this could possibly be done with a dealer but I cant understand how it is done without a dealer.
Of course this could just be due to my lack of understanding but I reserve the right to keep asking stupid questions in order to try and improve my understanding.

I don't see it either, except by repeating the process for each of the the m choose n satisfactions; which you can't do for a single secret without a dealer. Thats why I was asking in the other thread where this was implemented when someone said it was.