The round complexity of perfectly secure general VSS

DOI10.1007/978-3-642-20728-0_14MaRDI QIDQ3002110zbMATH OpenOpenAlexFDO

Authors Ashish Choudhury, Kaoru Kurosawa, Arpita Patra

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20728-0_14

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The Round Complexity of Verifiable Secret Sharing Revisited
• The round complexity of verifiable secret sharing: the statistical case
• Theory of Cryptography
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Improving the round complexity of VSS in point-to-point networks

Cited in

(11)

• Improving the round complexity of VSS in point-to-point networks
• The round complexity of verifiable secret sharing: the statistical case
• The Round Complexity of Verifiable Secret Sharing Revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Verifiable secret sharing in a total of three rounds
• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• The round complexity of verifiable secret sharing and secure multicast
• The Exact Round Complexity of Secure Computation
• Theory of Cryptography
• A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
• VSS Made Simpler

This page was built for publication: The round complexity of perfectly secure general VSS

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