Secure Two-Party Computational Geometry

@article{Li2005SecureTC,
  title={Secure Two-Party Computational Geometry},
  author={Shundong Li and Yiqi Dai},
  journal={Journal of Computer Science and Technology},
  year={2005},
  volume={20},
  pages={258-263}
}
Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Privacy aware P 2 P Friend Locator

View 6 Excerpts
Highly Influenced

Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices

IEEE Transactions on Information Forensics and Security • 2014

Secure two-party computation with AES-128: Generic approach and exploiting specific properties of functions approach

The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014) • 2014
View 1 Excerpt

Privacy-Preserving Point-Inclusion Two-Party Computation Protocol

2013 International Conference on Computational and Information Sciences • 2013

Similar Papers

Loading similar papers…