Lecture notes in computer science

Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan

Published Jan 1, 2018• 121 citations

Related papers

Round Optimal Secure Multiparty Computation from Minimal Assumptions

Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal +2 more

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou +1 more

Two-Round Multiparty Secure Computation Minimizing Public Key Operations

Sanjam Garg, Peihan Miao, Akshayaram Srinivasan

Four-Round Secure Multiparty Computation from General Assumptions.

Michele Ciampi, Rafail Ostrovsky

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Arpita Patra, Akshayaram Srinivasan

On 2-Round Secure Multiparty Computation

Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz Z +1 more