NDLI: A Practical Three-Dimensional Privacy-Preserving Approximate Convex Hulls Protocol

Content Provider	IEEE Xplore Digital Library
Author	Dong Li Liusheng Huang Wei Yang Youwen Zhu Yonglong Luo Zhili Chen Lingjun Li Yun Ye
Copyright Year	2008
Description	Author affiliation: Dept. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China (Dong Li; Liusheng Huang; Wei Yang; Youwen Zhu; Yonglong Luo; Zhili Chen; Lingjun Li; Yun Ye)
Abstract	Convex hulls problem is a special case of privacy-preserving geometry problem in the inquiry of secure multi-party computation. In the past, only in two-dimensional space privacy-preserving convex hulls have been investigated, and there is little focus in the three-dimensional space. However, three-dimensional privacy-preserving convex hulls can be applied in many fields, such as researching and exploration of the space, military, corporately finding the union range based on sensitive data from two parties. Approximate convex hulls have more advantages than conventional convex hulls in the theme of secure multi-party computation because it can hide the private points on the vertices. In this paper, we first present a practical privacy-preserving protocol to solve the three dimensional approximate convex hulls problem; we also discuss the correctness, security, and performance of our protocol.
Starting Page	17
Ending Page	23
File Size	330198
Page Count	7
File Format	PDF
ISBN	9781424434183
DOI	10.1109/FCST.2008.11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-27
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Privacy-preserving Computational Geometry Military computing Secure Multi-party Computation Electronic mail Computational complexity Three-dimensional Convex Hulls Sliding mode control Computer science Approximate Convex Hulls Space technology High performance computing Detectors Space exploration
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Privacy-Preserving Practical Convex Hulls Protocol

A Practical Solution for Privacy-Preserving Approximate Convex Hulls Problem

Privacy-preserving Protocols for Finding the Convex Hulls

Privacy-Preserving Approximate Convex Hulls Protocol

Efficient Secure Protocols to Determine Whether a Point is inside a Convex Hull

A Secure Protocol for Determining the Meeting Points of Two Intersected Circles

Application of secure multi-party computation on judging privacy-preserving path

Privacy-Preserving Point-Inclusion Two-Party Computation Protocol

A Privacy Preserving Protocol for Generation the Common Tangent of Two Circles

A Practical Three-Dimensional Privacy-Preserving Approximate Convex Hulls Protocol

Similar Documents

Privacy-Preserving Practical Convex Hulls Protocol

A Practical Solution for Privacy-Preserving Approximate Convex Hulls Problem

Privacy-preserving Protocols for Finding the Convex Hulls

Privacy-Preserving Approximate Convex Hulls Protocol

Efficient Secure Protocols to Determine Whether a Point is inside a Convex Hull

A Secure Protocol for Determining the Meeting Points of Two Intersected Circles

Application of secure multi-party computation on judging privacy-preserving path

Privacy-Preserving Point-Inclusion Two-Party Computation Protocol

A Privacy Preserving Protocol for Generation the Common Tangent of Two Circles

A Practical Three-Dimensional Privacy-Preserving Approximate Convex Hulls Protocol