|visits||member for||2 years, 11 months|
|seen||Sep 9 at 20:21|
Voting scheme where the votes become public when a threshold is reached
@mikeazo: Under the weak assumption of secret voting, your observation does prove that you can't have any further votes. But this is no issue e.g. when the threshold is set to 51% of voters.
Is it possible to create an easy to use encryption/decryption method that will never be comprimised?
Actually, there's an infinite set of ciphers that are cannot be broken, but they all share the 4 points you list. Trivially, for any bijective function f,