Secure multiparty computation studies deals with privacy-preserving computation, where several parties, some of them holding private inputs, want to collaborate in computing some function depending on them while at the same time avoiding to reveal more information about these inputs that it is necessary to perform the computation. Some of the most popular ways of performing secure computation involve the notion of secret sharing. The problem however is that secret-sharing based secure computation protocols require to represent the function to be computed as a arithmetic circuit over a large finite field, which for certain functions is not the most natural representation. In this talk, I will present some of my recent research that it is oriented to adapt some of these protocols to compute boolean circuits, in a way that the amortized communication complexity is still almost as good as the one for the original protocols.