Lattice codes have recently found application in models with secrecy constraints. They have been shown to yield non-trivial, and in the case of a multi-hop network with confidential messages, scalable secrecy rates.  This talk will demonstrate that lattice codes provide secrecy when interference is present as well. In particular, K-user Gaussian Interference Channels with Confidential Messages are considered, and achievable rates are computed using nested lattice codes. For the K-user symmetric interference channel with confidential messages, achievable secrecy rates are derived with for very strong interference, along with the secure degrees of freedom for a range of channel parameters. For the K-user many-to-one interference channel with confidential messages, achievable secrecy rates are derived, as well as an upper bound on the secrecy sum rate. For very strong interference, it is shown that the gap between the two bounds is a function of the number of users only, and that the rate penalty incurred per user due to the secrecy constraints diminishes as the number of users increases.