Talk:Verifiable secret sharing

Computing Mid‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Mid	This article has been rated as Mid-importance on the project's importance scale.

Cryptography: Computer science Mid‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
Mid	This article has been rated as Mid-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Mid-importance).

Modulo what ?

When checking the shares, which modulo should be used ? Is the computation in Z_p or Z_q ?

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)[reply]

Benaloh's scheme was added

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)[reply]

= Application to e-voting seems not to make sense to me

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)[reply]