The Round Complexity of Verifiable Secret Sharing Revisited

DOI10.1007/978-3-642-03356-8_29zbMath1252.94110OpenAlexW1484047614MaRDI QIDQ3183581

Tal Rabin, Ashish Choudhury, C. Pandu Rangan, Arpita Patra

Publication date: 20 October 2009

Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_29

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (16)

Secure Computation with Minimal Interaction, Revisited ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Improving the round complexity of VSS in point-to-point networks ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Secure message transmission in asynchronous networks ⋮ Verifiable secret sharing in a total of three rounds ⋮ Efficient VSS free of computational assumption ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Strong \((n, t, n)\) verifiable secret sharing scheme ⋮ On the exact round complexity of secure three-party computation ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

This page was built for publication: The Round Complexity of Verifiable Secret Sharing Revisited