A secure multiparty computation protocol allows a set of mutually distrusting parties to compute a joint function of their private inputs without leaking anything apart from the output of the functionality. Ever since the initial results on this topic, an active line of research has been to minimize the number of rounds needed for securely computing any functionality as well as minimize the assumptions under which protocol can be proven secure. In this work, we give a construction of round-optimal secure multiparty computation from the minimal assumption that two-round oblivious transfer exists. I will also discuss several extensions of the result. Based on joint work with Sanjam Garg.