Sharing confidential information in distributed systems is a necessity in many applications, however, it opens the problem of controlling information sharing even among trusted parties. In this paper, we present a formal model in which dissemination of information is disabled at the level of the syntax in a direct way. We introduce a subcalculi of the p-calculus in which channels are considered as confidential information. The only difference with respect to the pi-calculus is that channels once received cannot be forwarded later on. Another contribution of the model is that some privacy notions already studied in the past, such as group creation and name hiding, are directly representable without any additional language constructs. We also present an encoding of the pi-calculus in our calculus.