On the complexity of verifiable secret sharing and multiparty computation
From MaRDI portal
Publication:3192000
DOI10.1145/335305.335343zbMath1296.94149OpenAlexW2031137180MaRDI QIDQ3192000
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