Broadcast (and round) efficient verifiable secret sharing

DOI10.1007/978-3-319-04268-8_12MaRDI QIDQ2948264zbMATH OpenOpenAlexFDO

Authors Juan Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04268-8_12

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improving the Round Complexity of VSS in Point-to-Point Networks
• Improving the round complexity of VSS in point-to-point networks
• Theory of Cryptography
• The round complexity of verifiable secret sharing and secure multicast
• Verifiable secret sharing in a total of three rounds

Cites work

• Almost-Everywhere Secure Computation
• Authenticated Algorithms for Byzantine Agreement
• Broadcast (and round) efficient verifiable secret sharing
• Detectable Byzantine agreement secure against faulty majorities
• Efficient Byzantine Agreement with Faulty Minority
• Fault Tolerance in Networks of Bounded Degree
• scientific article; zbMATH DE number 176512 (Why is no real title available?)
• scientific article; zbMATH DE number 1304080 (Why is no real title available?)
• scientific article; zbMATH DE number 1942420 (Why is no real title available?)
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On Expected Constant-Round Protocols for Byzantine Agreement
• On the complexity of broadcast setup
• Optimally efficient multi-valued byzantine agreement
• Perfectly secure message transmission
• Round-Efficient Secure Computation in Point-to-Point Networks
• Secure message transmission by public discussion: a brief survey
• Secure multi-party computation without agreement
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The Round Complexity of Verifiable Secret Sharing Revisited
• The round complexity of verifiable secret sharing: the statistical case
• Theory of Cryptography
• Tolerating linear number of faults in networks of bounded degree

Cited in

(13)

• Improving the round complexity of VSS in point-to-point networks
• Optimal extension protocols for Byzantine broadcast and agreement
• Broadcast (and round) efficient verifiable secret sharing
• Computational verifiable secret sharing revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Verifiable secret sharing in a total of three rounds
• Asynchronous computational VSS with reduced communication complexity
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• Asymptotically free broadcast in constant expected time via packed VSS
• VSS Made Simpler
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Secret sharing schemes with partial broadcast channels
• A one-round secure message broadcasting protocol through a key sharing tree

This page was built for publication: Broadcast (and round) efficient verifiable secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948264)