Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

DOI10.1007/978-3-642-12678-9_12zbMath1284.94144OpenAlexW1748404930MaRDI QIDQ3558312

C. Pandu Rangan, Ashish Choudhury, Arpita Patra

Publication date: 4 May 2010

Published in: Progress in Cryptology – AFRICACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12678-9_12

zbMATH Keywords

verifiable secret sharingmultiparty computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Secure message transmission in asynchronous networks ⋮ Efficient VSS free of computational assumption ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation

This page was built for publication: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience