# How do you distribute secret shares without knowing who to first distribute them to?

Figure 1 on page 1249 of the “Multiparty Computation Secure Against Continual Memory Leakage” paper shows $m$ committees are elected in step 1 and then later in step 3 are each given a secret share.

But I was wondering if it is possible to pull out the election of $m$ committees from the pre-processing phase and do it in a different phase (like online phase)? The problem with the pre-processing phase is it is assumes no leakage so simplifying it is a step closer to completely getting rid of it.

I am essentially wondering if it is possible to distribute secret shares without knowing the committees (i.e. “don't run election protocol immediately, run it later”)?

-
I'm confused, you want to distribute shares w/o knowing who to distribute them to? That seems impossible. Maybe an example usage scenario would help? – mikeazo Dec 30 '13 at 14:47
@mikeazo - i think what i am asking is if it is possible to compute secret shares and distribute them at a later stage. I think in the paper authors figure out who the committees are first and then immediately distribute secret shares after they are computed. I'm wondering if the election could be done at a later (leaky) stage. In general doing it in a leaky environment is favorable because it makes a better protocol. – user1068636 Dec 30 '13 at 19:09