On the complexity of verifiable secret sharing and multiparty computation

DOI10.1145/335305.335343MaRDI QIDQ3192000zbMATH OpenOpenAlexFDO

Authors Ronald Cramer, Stefan Dziembowski, Ivan B. Damgård

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335343

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 and secure multicast
• Computational verifiable secret sharing revisited
• scientific article; zbMATH DE number 1676641
• On the message complexity of secure multiparty computation
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Secure multiparty computation and secret sharing
• Tight bounds on the randomness complexity of secure multiparty computation
• The bottleneck complexity of secure multiparty computation
• The round complexity of verifiable secret sharing: the statistical case

Cited in

(9)

• On the message complexity of secure multiparty computation
• A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
• Advances in Cryptology - EUROCRYPT 2004
• General secure multi-party computation from any linear secret-sharing scheme
• scientific article; zbMATH DE number 1676641 (Why is no real title available?)
• VSS Made Simpler
• Verifiably multiplicative secret sharing
• A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
• Applied Cryptography and Network Security

This page was built for publication: On the complexity of verifiable secret sharing and multiparty computation

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