A practical solution for privacy-preserving approximate convex hulls problem

Li Dong; Huang Liusheng; Yang Wei; Zhu Youwen; Luo Yonglong; Li Lingjun; Chen Zhili

doi:10.1109/CMC.2009.97

A practical solution for privacy-preserving approximate convex hulls problem

Li Dong^*
, Huang Liusheng
, Yang Wei
, Zhu Youwen
, Luo Yonglong
, Li Lingjun
, Chen Zhili

^*Corresponding author for this work

University of Science and Technology of China

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex hulls problem and provide a practical protocol which is more secure and efficient than previous convex hulls protocols. We also show that it can be applied to finding the approximate intersection area of two private convex hulls.

Original language	English
Title of host publication	Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Pages	539-544
Number of pages	6
DOIs	https://doi.org/10.1109/CMC.2009.97
State	Published - 2009
Externally published	Yes
Event	2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 - Kunming, Yunnan, China Duration: 6 Jan 2009 → 8 Jan 2009

Publication series

Name	Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Volume	3

Conference

Conference	2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Country/Territory	China
City	Kunming, Yunnan
Period	6/01/09 → 8/01/09

Access to Document

10.1109/CMC.2009.97

Cite this

Dong, L., Liusheng, H., Wei, Y., Youwen, Z., Yonglong, L., Lingjun, L., & Zhili, C. (2009). A practical solution for privacy-preserving approximate convex hulls problem. In Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 (pp. 539-544). Article 4797311 (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009; Vol. 3). https://doi.org/10.1109/CMC.2009.97

@inproceedings{fc89959ead16486d9717dde088aed38b,

title = "A practical solution for privacy-preserving approximate convex hulls problem",

abstract = "Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex hulls problem and provide a practical protocol which is more secure and efficient than previous convex hulls protocols. We also show that it can be applied to finding the approximate intersection area of two private convex hulls.",

author = "Li Dong and Huang Liusheng and Yang Wei and Zhu Youwen and Luo Yonglong and Li Lingjun and Chen Zhili",

year = "2009",

doi = "10.1109/CMC.2009.97",

language = "英语",

isbn = "9780769535012",

series = "Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009",

pages = "539--544",

booktitle = "Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009",

note = "2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 ; Conference date: 06-01-2009 Through 08-01-2009",

}

Dong, L, Liusheng, H, Wei, Y, Youwen, Z, Yonglong, L, Lingjun, L & Zhili, C 2009, A practical solution for privacy-preserving approximate convex hulls problem. in Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009., 4797311, Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, vol. 3, pp. 539-544, 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009, Kunming, Yunnan, China, 6/01/09. https://doi.org/10.1109/CMC.2009.97

A practical solution for privacy-preserving approximate convex hulls problem. / Dong, Li; Liusheng, Huang; Wei, Yang et al.
Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009. 2009. p. 539-544 4797311 (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A practical solution for privacy-preserving approximate convex hulls problem

AU - Dong, Li

AU - Liusheng, Huang

AU - Wei, Yang

AU - Youwen, Zhu

AU - Yonglong, Luo

AU - Lingjun, Li

AU - Zhili, Chen

PY - 2009

Y1 - 2009

N2 - Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex hulls problem and provide a practical protocol which is more secure and efficient than previous convex hulls protocols. We also show that it can be applied to finding the approximate intersection area of two private convex hulls.

AB - Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex hulls problem and provide a practical protocol which is more secure and efficient than previous convex hulls protocols. We also show that it can be applied to finding the approximate intersection area of two private convex hulls.

UR - https://www.scopus.com/pages/publications/64749084002

U2 - 10.1109/CMC.2009.97

DO - 10.1109/CMC.2009.97

M3 - 会议稿件

AN - SCOPUS:64749084002

SN - 9780769535012

T3 - Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009

SP - 539

EP - 544

BT - Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009

T2 - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009

Y2 - 6 January 2009 through 8 January 2009

ER -

Dong L, Liusheng H, Wei Y, Youwen Z, Yonglong L, Lingjun L et al. A practical solution for privacy-preserving approximate convex hulls problem. In Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009. 2009. p. 539-544. 4797311. (Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009). doi: 10.1109/CMC.2009.97

A practical solution for privacy-preserving approximate convex hulls problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this