Ok, I am shooting from the hip here quickly (so what follows could very well be wrong), but let's try this:
-
do you see how it is easy to extend a 1 of 2 oblivious transfer (oblivious signing in our case) to a 1 of n?
-
if so, then Alice funds the output with amount
U
and can sell sell a ticket to each Bob for an amount slightly more thanU / n
(it is slightly more so that, in expectation she can earn a profit). -
if one of the Bob's wins they will, naturally, move/claim the utxo
-
if more than one Bob wins, they will have a fee fight
I think for large enough
n
and slow enough ticket sales, these issues are surmountable, no?
n
players.Pick
transactions would need to be chosen arbitrarily by Alice. Bob might be able to claim the output of thePick
TX depending on his choice of bit, and depending whichPick
transaction Alice chose.Pick
transaction to publish so that Carol wins the 3-way lottery, thus taking Bob's money.n
-player lottery to work fairly, it has to be impossible for anybody to predict or dictate the outcome in advance, as long as at least one player is honest.