Broadcast (and Round) Efficient Verifiable Secret Sharing

DOI10.1007/978-3-319-04268-8_12zbMath1395.94323OpenAlexW2095839644MaRDI QIDQ2948264

Rafail Ostrovsky, Juan A. Garay, Clint Givens, 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)

Related Items (2)

Optimal extension protocols for Byzantine broadcast and agreement ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secure multi-party computation without agreement
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
• Broadcast (and Round) Efficient Verifiable Secret Sharing
• Secure Message Transmission by Public Discussion: A Brief Survey
• Authenticated Algorithms for Byzantine Agreement
• The Round Complexity of Verifiable Secret Sharing: The Statistical Case
• The Round Complexity of Verifiable Secret Sharing Revisited
• Efficient Byzantine Agreement with Faulty Minority
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Fault Tolerance in Networks of Bounded Degree
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Perfectly secure message transmission
• Detectable byzantine agreement secure against faulty majorities
• Optimally efficient multi-valued byzantine agreement
• On the Complexity of Broadcast Setup
• Tolerating linear number of faults in networks of bounded degree
• Round-Efficient Secure Computation in Point-to-Point Networks
• Almost-Everywhere Secure Computation
• On Expected Constant-Round Protocols for Byzantine Agreement
• Theory of Cryptography

This page was built for publication: Broadcast (and Round) Efficient Verifiable Secret Sharing