Title: Lower Bound Techniques for Information-Theoretic MPC

Abstract: We cover some proof techniques for lower bounding the communication required for information theoretic MPC. We first look at statistical passive security and then at perfect malicious security with abort. In both cases, the bounds are optimal in the sense that matching upper bounds are known. We finish with some open problems.