Abstract: Secure multi-party computation (SMC) is a multi-party cooperative computation conducted by a group of participants on the premise that they do not trust each other and will not disclose any of their private information. Secure intersection computation (SIC), an important sub-concern of SMC, is focused on how to acquire intersection through cooperative computing and ensure the security of privacy, which has a significant application prospect in regard to social networks, military and commercial fields. In view of the low efficiency and complexity of current intersection computation methods, a high-efficient and secure intersection computation protocol is proposed. Under such a protocol, each element within a set will be converted into a dot in planar space and the intersection can be computed and acquired through the distance relations between these dots. At last, the correctness, security and complexity of the protocol are analyzed and verified through simulation experiment.