Verifiable secret sharing in a total of three rounds

DOI10.1016/J.IPL.2012.08.003MaRDI QIDQ456152zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Round Complexity of Verifiable Secret Sharing Revisited
• Theory of Cryptography
• The round complexity of perfectly secure general VSS
• The round complexity of verifiable secret sharing: the statistical case
• Broadcast (and round) efficient verifiable secret sharing

Cites work

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

Cited in

(6)

• Theory of Cryptography
• VSS Made Simpler
• The Round Complexity of Verifiable Secret Sharing Revisited
• Secure computation with minimal interaction, revisited
• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• Broadcast (and round) efficient verifiable secret sharing

This page was built for publication: Verifiable secret sharing in a total of three rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456152)