Most real applications use asynchronous communication model. Thus, in order to 
use MPC in such applications, we require techniques to handle asynchronicity. 
In this talk, I briefly describe our asynchronous algorithm to solve MPC over 
n parties, when strictly less than a t < n/8 of the parties are controlled by 
a static adversary. Our focus will be on asynchrony challenges, and I describe 
a distributed data structure, called a t-counter that addresses threshold 
counting problem in MPC. This data structure is designed to ensure that at 
least n-t inputs are sent, before the circuit is evaluated. By using t-counter, 
MPC can be solved without assuming any synchrony points in the algorithm. Such 
techniques can be applied to other MPC schemes, and of independent interest in 
other applications with load-balancing goals. This talk presents our work 
published in ICDCN 2014 that won the best paper award.