In this talk, we'll discuss use of information theoretic techniques for achieving security properties beyond mere secure communication. In particular, we focus on the usefulness of noisy channels to achieve the goal of secure computation: A typical situation has two parties, Alice and Bob, each holding a private input x and y (respectively), where they wish to jointly compute f(x,y) without revealing anything beyond f(x,y) to the other party. For most functions f, such secure computation is impossible information-theoretically unless the two parties have access to a suitable noisy channel. We will discuss recent developments in this line of work.