Verifiable secret sharing in a total of three rounds

DOI10.1016/j.ipl.2012.08.003zbMath1250.94053OpenAlexW2015316544MaRDI QIDQ456152

Shashank Agrawal

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.003

zbMATH Keywords

cryptographyunconditional securitysecret sharingByzantine adversaryround optimality

Mathematics Subject Classification ID

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

Related Items

Secure Computation with Minimal Interaction, Revisited

Cites Work

• A lower bound for the time to assure interactive consistency
• Improving the round complexity of VSS in point-to-point networks
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Reaching Agreement in the Presence of Faults
• The round complexity of verifiable secret sharing and secure multicast
• Theory of Cryptography