This HTML5 document contains 33 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n11https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Privacy-preserving_computational_geometry
rdf:type
dbo:Place
rdfs:label
Privacy-preserving computational geometry
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.
dcterms:subject
dbc:Computational_fields_of_study dbc:Computational_geometry dbc:Theory_of_cryptography
dbo:wikiPageID
41056398
dbo:wikiPageRevisionID
1072105980
dbo:wikiPageWikiLink
dbc:Computational_geometry dbr:Alice_and_Bob dbr:Range_searching dbc:Theory_of_cryptography dbc:Computational_fields_of_study dbr:Computational_geometry dbr:Secure_multi-party_computation dbr:Point_in_polygon dbr:Convex_hull
owl:sameAs
wikidata:Q17083472 n11:fJ1e yago-res:Privacy-preserving_computational_geometry freebase:m.0z6tpw0
dbp:wikiPageUsesTemplate
dbt:Reflist
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.
gold:hypernym
dbr:Area
prov:wasDerivedFrom
wikipedia-en:Privacy-preserving_computational_geometry?oldid=1072105980&ns=0
dbo:wikiPageLength
2635
foaf:isPrimaryTopicOf
wikipedia-en:Privacy-preserving_computational_geometry
Subject Item
dbr:Secure_multi-party_computation
dbo:wikiPageWikiLink
dbr:Privacy-preserving_computational_geometry
Subject Item
dbr:Secure_computational_geometry
dbo:wikiPageWikiLink
dbr:Privacy-preserving_computational_geometry
dbo:wikiPageRedirects
dbr:Privacy-preserving_computational_geometry
Subject Item
dbr:Secure_multi-party_geometric_computation
dbo:wikiPageWikiLink
dbr:Privacy-preserving_computational_geometry
dbo:wikiPageRedirects
dbr:Privacy-preserving_computational_geometry
Subject Item
wikipedia-en:Privacy-preserving_computational_geometry
foaf:primaryTopic
dbr:Privacy-preserving_computational_geometry