About: Privacy-preserving computational geometry

An Entity of Type: place, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more. A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure point in polygon inclusion and polygonal intersection problems were considered.

Property Value
dbo:abstract
  • Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more. A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure point in polygon inclusion and polygonal intersection problems were considered. Other problems are computation of the distance between two private points and secure two-party point-circle inclusion problem. (en)
dbo:wikiPageID
  • 41056398 (xsd:integer)
dbo:wikiPageLength
  • 2635 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1072105980 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more. A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure point in polygon inclusion and polygonal intersection problems were considered. (en)
rdfs:label
  • Privacy-preserving computational geometry (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License