We study the mechanism design problem in the setting where agents are rewarded using information only, which is motivated by the increasing interest in secure multiparty computation. Specifically, we consider the setting of a joint computation where different agents have inputs of different quality and each agent is interested in learning as much as possible while maintaining exclusivity for information. Our high level question is how to design mechanisms that motivate all the agents (even those with high-quality inputs) to participate in the computation; we formally study problems such as set union, intersection, and average.