Towards characterizing securely computable two-party randomized functions
From MaRDI portal
Publication:1749306
DOI10.1007/978-3-319-76578-5_23zbMath1441.94074OpenAlexW2745756790MaRDI QIDQ1749306
Deepesh Data, Manoj Prabhakaran
Publication date: 16 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76578-5_23
Related Items
Computational hardness of optimal fair computation: beyond Minicrypt, On fully secure MPC with solitary output