scispace - formally typeset
Search or ask a question

Showing papers on "Verifiable secret sharing published in 1985"


Proceedings ArticleDOI
21 Oct 1985
TL;DR: Verifiable secret sharing as discussed by the authors is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute it to 11 people so that tile secret is reconstructible given only sufficiently many pieces.
Abstract: Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces. 'rhe novelty is that everyone can verify that all received a "valid" piece of the secret without having any idea of what the secret is. One application of this tool is the simulation of simultaneous-broadcast networks on semi-synchronous broadcast networks.

760 citations


Proceedings Article
01 Jan 1985
TL;DR: Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only sufficiently many pieces.

710 citations


Proceedings Article
01 Jan 1985
TL;DR: In this article, the authors describe a cryptographic scheme for holding a secure secret ballot election in which all communication is public, and voters cast their votes electronically, suitably encrypted, and a "government" releases a tally and a proof of its correctness which can be verified by all.
Abstract: This paper describes a cryptographic scheme for holding a secure secret ballot election in which all communication is public. Voters cast their votes electronically, suitably encrypted, and a “government” releases a tally and a proof of its correctness which can be verified by all.

420 citations


Proceedings ArticleDOI
21 Oct 1985
TL;DR: A cryptographic scheme for holding a secure secret ballot election in which all communication is public is described, which introduces a new form of "interactive proof" by which one participant gives passive observers high confidence that certain claims are true without releasing related private information.
Abstract: This paper describes a cryptographic scheme for holding a secure secret ballot election in which all communication is public. Voters cast their votes electronically, suitably encrypted, and a “government” releases a tally and a proof of its correctness which can be verified by all.

367 citations