Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation

DOI10.1007/11593447_5zbMath1154.94457OpenAlexW1763785618MaRDI QIDQ5451065

Martin Hirt, Jesper Buus Nielsen

Publication date: 18 March 2008

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

Full work available at URL: https://doi.org/10.1007/11593447_5

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Tight bounds for the multiplicative complexity of symmetric functions ⋮ Multi-party computation with conversion of secret sharing ⋮ Secure Protocol Transformations

This page was built for publication: Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation