Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Privacy-preserving computational geometry
open-in-new
<h2 id="problem-statements">Problem statements</h2> <p>The problems use the conventional "<a href="/facts/Alice_and_Bob/FSHudRmA">Alice and Bob</a>" terminology. In all problems the required solution is a protocol of information exchange during which no additional information is revealed beyond what may be inferred from the answer to the required question. </p> <ul><li>Point-in-polygon: Alice has a point <i>a</i>, and Bob has a polygon <i>B</i>. They need to determine whether <i>a</i> is inside <i>B</i>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></li> <li>Polygon pair intersection: Alice has a polygon <i>A</i>, and Bob has a polygon <i>B</i>. They need to determine whether A intersects B.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>"Archived copy" (PDF). Archived from the original (PDF) on 2013-11-12. Retrieved 2013-11-12.{{cite web}}: CS1 maint: archived copy as title (link) <a href="https://web.archive.org/web/20131112073625/http://www.joics.com/publishedpapers/2012_9_4_915_929.pdf" target="_blank">https://web.archive.org/web/20131112073625/http://www.joics.com/publishedpapers/2012_9_4_915_929.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Kaitai LIANG, Bo YANG, Dake HE, Min ZHOU, Privacy-Preserving Computational Geometry Problems on Conic Sections, Journal of Computational Information Systems 7: 6 (2011) 1910–1923 <a href="http://www.jofcis.com/publishedpapers/2011_7_6_1910_1923.pdf" target="_blank">http://www.jofcis.com/publishedpapers/2011_7_6_1910_1923.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Atallah M J, Du W. Secure Multiparty Computational Geometry. In Proc. Algorithms and Data Structures: 7th International Workshop, WADS 2001, Lecture Notes in Computer Science, LNCS 2125, Providence, RI, USA, pages 165–179, August 8–10, 2001. (As cited by Liang et al. 2011) <a href="/wiki/Mikhail_Atallah" target="_blank">/wiki/Mikhail_Atallah</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Li S D, Dai Y Q. Secure two-party computational geometry. Journal of Computer Science and Technology, 20(2): pages 258–263, 2005. <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Luo Y L, Huang L S, Zhong H. Secure two-party point-circle inclusion problem. Journal of Computer Science and Technology, 22(1): pages 88–91, 2007 <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Atallah M J, Du W. Secure Multiparty Computational Geometry. In Proc. Algorithms and Data Structures: 7th International Workshop, WADS 2001, Lecture Notes in Computer Science, LNCS 2125, Providence, RI, USA, pages 165–179, August 8–10, 2001. (As cited by Liang et al. 2011) <a href="/wiki/Mikhail_Atallah" target="_blank">/wiki/Mikhail_Atallah</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Atallah M J, Du W. Secure Multiparty Computational Geometry. In Proc. Algorithms and Data Structures: 7th International Workshop, WADS 2001, Lecture Notes in Computer Science, LNCS 2125, Providence, RI, USA, pages 165–179, August 8–10, 2001. (As cited by Liang et al. 2011) <a href="/wiki/Mikhail_Atallah" target="_blank">/wiki/Mikhail_Atallah</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> </ol>