Non-interactive multiparty computation without correlated randomness

DOI10.1007/978-3-319-70700-6_7zbMath1417.94061OpenAlexW2768714820MaRDI QIDQ1701442

Eylon Yogev, Abhishek Jain, Shai Halevi, Amit Sahai, Ilan Komargodski, Yuval Ishai

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_7

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Best possible information-theoretic MPC ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Puncturable signature: a generic construction and instantiations ⋮ How to obfuscate MPC inputs ⋮ Additive randomized encodings and their applications ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Blockchains enable non-interactive MPC ⋮ Threshold garbled circuits and ad hoc secure computation