Talk:Verifiable secret sharing
Latest comment: 8 years ago by 83.99.64.82 in topic = Application to e-voting seems not to make sense to me
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||
| ||||||||||||||||||||||||
Modulo what ? edit
When checking the shares, which modulo should be used ? Is the computation in Zp or Zq ?
- I clarified this and various other issues found in the article, hopefully things are a bit clearer now. BlackFingolfin 10:32, 31 July 2006 (UTC)
Benaloh's scheme was added edit
it is now very late, fill free to do some clarifying (if needed) on the new topic. --Good Day, Tzvika Velich 00:55, 27 April 2007 (UTC)
= Application to e-voting seems not to make sense to me edit
As it is now written, it does not make sense. If a vote gives the tellers shares of his/her vote, the tellers can reconstruct the vote breaking the privacy. — Preceding unsigned comment added by 83.99.64.82 (talk) 19:33, 19 June 2015 (UTC)