Does pseudorandom secret sharing require a central dealer? I'm trying to figure out whether pseudorandom secret sharing (as described in this paper) requires a central dealer, i.e. one party who doles out keys to the other players and thus who would be able to generate all the pseudorandom numbers on their own. 

I'm new to this, so the paper is almost completely opaque to me, and there doesn't seem to be any dumbed down versions of this technique anywhere on the internet. 

The implementation of PRSS in VIFF appears to require a central person to generate everyone's initial keys, but this doesn't seem necessary, i.e. you could make an implementation where everyone generates their own random keys and shares them with the appropriate parties as necessary. 

However, VIFF's use of "dealer keys" confuses me, and makes me think that at some point, some party could generate all the pseudorandom numbers on their own. I've tried to read through the code, but I've reached a point where it's just as opaque to me as the aforementioned paper.

Is there anyone who can explain this?
In secret sharing, one person typically wants to share a secret. Only that one person knows that secret, so they are the dealer.

In MPC, which VIFF implements protocols for, you actually have multiple parties, each with a secret input(s). So, each of these parties is the dealer for their individual secret input(s). In this sense, there is no central dealer for the entire computation.