On the (In)Efficiency of Non-Interactive Secure Multiparty Computation

DOI10.1007/978-3-319-30840-1_12zbMath1352.94076OpenAlexW2478070413MaRDI QIDQ2806770

Maki Yoshida, Satoshi Obana

Publication date: 19 May 2016

Published in: Information Security and Cryptology - ICISC 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30840-1_12

zbMATH Keywords

upper boundlower boundcommunication complexitymultiparty computationnon-interactiveinformation theoretical setting

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

On the (in)efficiency of non-interactive secure multiparty computation

This page was built for publication: On the (In)Efficiency of Non-Interactive Secure Multiparty Computation