Robust non-interactive multiparty computation against constant-size collusion

DOI10.1007/978-3-319-63688-7_13zbMath1407.94084OpenAlexW2728575722MaRDI QIDQ1675732

Tal Rabin, Hugo Krawczyk, Fabrice Benhamouda

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_13

zbMATH Keywords

non-interactive multiparty computationprivate simultaneous messages

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ Best possible information-theoretic MPC ⋮ On the (in)efficiency of non-interactive secure multiparty computation ⋮ One-time programs from commodity hardware ⋮ Threshold garbled circuits and ad hoc secure computation

This page was built for publication: Robust non-interactive multiparty computation against constant-size collusion