Broadcast (and round) efficient verifiable secret sharing

DOI10.1007/978-3-319-04268-8_12zbMATH Open1395.94323OpenAlexW2095839644MaRDI QIDQ2948264FDOQ2948264

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

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

Mathematics Subject Classification ID

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

Cites Work

• Authenticated Algorithms for Byzantine Agreement
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Perfectly secure message transmission
• Title not available (Why is that?)
• The Round Complexity of Verifiable Secret Sharing Revisited
• Efficient Byzantine Agreement with Faulty Minority
• Theory of Cryptography
• Fault Tolerance in Networks of Bounded Degree
• Almost-Everywhere Secure Computation
• Secure multi-party computation without agreement
• Detectable byzantine agreement secure against faulty majorities
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Title not available (Why is that?)
• On Expected Constant-Round Protocols for Byzantine Agreement
• Broadcast (and Round) Efficient Verifiable Secret Sharing
• Secure message transmission by public discussion: a brief survey
• Optimally efficient multi-valued byzantine agreement
• Tolerating linear number of faults in networks of bounded degree
• Round-Efficient Secure Computation in Point-to-Point Networks
• Title not available (Why is that?)
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• The round complexity of verifiable secret sharing: the statistical case
• On the Complexity of Broadcast Setup
• Title not available (Why is that?)

Cited In (9)

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

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)