Alternately you could look at some sort of secret sharing implementation where you encrypt and split up the master list into n chunks that you need any m of them to recover the original master list. Everyone gets a chunk of the list with their assignment and you'd have to have m of them collude to get it back (so you'd want to set m sufficiently high, of course).
(Well, you did say you were over-engineering . . . :)
The cake is a lie.
The cake is a lie.
The cake is a lie.
In reply to Re: Temporarily Obscuring a Lottery Draw
by Fletch
in thread Temporarily Obscuring a Lottery Draw
by kennethk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |