Re:A censorship resistant deadman's switch
by girvo on Wednesday April 25, 2018 @04:31PM
(#16925785)
I built exactly what you’ve described, using semi-homomorphic encryption (addition of integers, used plainly as we were under the noise threshold of participants). Luckily for me though, I got to punt on some of the really hard questions of trust — the nodes that were communicating are adversarial, but the outside “organising” network was the government and “us” (company I worked for). It’s a really fun problem. I highly recommend taking a crack at it, or even just reading the literature regarding digital voting — you need to prove that one vote was cast for a given person, and no more, without ever tying back any specific vote to said person, and with a huge range of attack vectors!
Was this a traceable ring signature[1], or something different?
[1] https://en.wikipedia.org/wiki/Ring_signature#Applications_an...
Re:A censorship resistant deadman's switch
by XR0CSWV3h3kZWg on Wednesday April 25, 2018 @04:44PM
(#16925914)
Neat! Thanks for sharing.
The really bad part would be that if the poisoner happens to be the last step then the final step would produce the secret before handing it to be poisoned.