Skip to search formSkip to main contentSkip to account menu

Privacy-preserving computational geometry

Known as: Secure computational geometry, Secure multi-party geometric computation 
Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
With the fast growth of the network, more and more cooperation opportunities come out in distributed systems. Privacy attracts… 
2012
2012
Numerous privacy-preserving issues have emerged along with the fast development of Internet, both in theory and in real-life… 
2012
2012
As the basic issues of computational geometry, intersection and union of convex polygons can solve lots of problems, such as… 
2012
2012
Privacy-Preserving computational geometry problem refers to several users computing a cooperative task,where no user prefers his… 
2011
2011
Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. In recent years… 
2010
2010
Privacy-Preserving Computational Geometry is a kind of special secure multi-party computation problem. As a special privacy… 
2010
2010
Privacy-preserving computational geometry is a kind of special SMC issue.As a kind of special privacy-preserving geometric… 
2009
2009
Secure multi-party computation is one of research focuses in information security field.Privacy-preserving computational geometry… 
2009
2009
Private-preserving shared dot product protocol is an important protocol of many secure multi-party computation problems. It has… 
2007
2007
Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous…