Lecture notes in computer science

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam

Published Jan 1, 2018• 14 citations

Related papers

Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan

Round Optimal Secure Multiparty Computation from Minimal Assumptions

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

Four-Round Secure Multiparty Computation from General Assumptions.

Michele Ciampi, Rafail Ostrovsky

Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

Dana Dachman-Soled, Jonathan I. Katz, Vanishree Rao

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