The Round Complexity of Verifiable Secret Sharing: The Statistical Case

DOI10.1007/978-3-642-17373-8_25zbMath1294.94096OpenAlexW1535684794MaRDI QIDQ3058670

Ranjit Kumaresan, C. Pandu Rangan, Arpita Patra

Publication date: 7 December 2010

Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

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

zbMATH Keywords

verifiable secret sharinground complexity

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Verifiable quantum secret sharing based on a single qudit ⋮ The round complexity of statistical MPC with optimal resiliency ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

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