Information-theoretic 2-round MPC without round collapsing: adaptive security, and more

DOI10.1007/978-3-030-64378-2_18zbMath1485.94107OpenAlexW3117371851MaRDI QIDQ2119057

Huijia Lin, Tianren Liu, Hoeteck Wee

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_18

zbMATH Keywords

secure multi-party computationsecure protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Distributed systems (68M14)

Related Items (5)

Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Round-optimal black-box protocol compilers ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications

This page was built for publication: Information-theoretic 2-round MPC without round collapsing: adaptive security, and more