Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection
The model and framework of secure multi-party computational geometry were presented based on the existing protocols.The new framework has three dimensions,the math model,the security model and the communication model.Using the new model and framework,a secure two-party line segments intersection pro...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2013)01-0030-13/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539858227527680 |
|---|---|
| author | Mao-hua SUN Shou-shan LUO Yang XIN Yi-xian YANG |
| author_facet | Mao-hua SUN Shou-shan LUO Yang XIN Yi-xian YANG |
| author_sort | Mao-hua SUN |
| collection | DOAJ |
| description | The model and framework of secure multi-party computational geometry were presented based on the existing protocols.The new framework has three dimensions,the math model,the security model and the communication model.Using the new model and framework,a secure two-party line segments intersection protocol based on Paillier homomorphic encryption scheme is proposed.This protocol solves the problem that the existing secure two party intersect-determination schemes of line segments cannot output the exact coordinates of the intersection.The security of the protocol is demonstrated using Goldreich method.The results show that this protocol has better efficiency than the existing ones.In addition,the secure two-party line segments intersection in malicious model is also designed.As an application,a privacy-preserving convex hull intersection protocol is proposed based on the O’Rourke scheme.This application makes up for the gap in privacy-preserving convex hull intersection protocol in the area of secure multi-party computational geometry. |
| format | Article |
| id | doaj-art-0a93112b29954c7aafda7d633dca6cfc |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-0a93112b29954c7aafda7d633dca6cfc2025-01-14T06:34:05ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-01-0134304259668052Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersectionMao-hua SUNShou-shan LUOYang XINYi-xian YANGThe model and framework of secure multi-party computational geometry were presented based on the existing protocols.The new framework has three dimensions,the math model,the security model and the communication model.Using the new model and framework,a secure two-party line segments intersection protocol based on Paillier homomorphic encryption scheme is proposed.This protocol solves the problem that the existing secure two party intersect-determination schemes of line segments cannot output the exact coordinates of the intersection.The security of the protocol is demonstrated using Goldreich method.The results show that this protocol has better efficiency than the existing ones.In addition,the secure two-party line segments intersection in malicious model is also designed.As an application,a privacy-preserving convex hull intersection protocol is proposed based on the O’Rourke scheme.This application makes up for the gap in privacy-preserving convex hull intersection protocol in the area of secure multi-party computational geometry.http://www.joconline.com.cn/zh/article/doi/1000-436X(2013)01-0030-13/cryptographysecure multi-party computational geometrysecure two-party line segments intersection schemeprivacy-preservingconvex hull intersection scheme |
| spellingShingle | Mao-hua SUN Shou-shan LUO Yang XIN Yi-xian YANG Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection Tongxin xuebao cryptography secure multi-party computational geometry secure two-party line segments intersection scheme privacy-preserving convex hull intersection scheme |
| title | Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection |
| title_full | Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection |
| title_fullStr | Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection |
| title_full_unstemmed | Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection |
| title_short | Secure two-party line segments intersection scheme and its application in privacy-preserving convex hull intersection |
| title_sort | secure two party line segments intersection scheme and its application in privacy preserving convex hull intersection |
| topic | cryptography secure multi-party computational geometry secure two-party line segments intersection scheme privacy-preserving convex hull intersection scheme |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2013)01-0030-13/ |
| work_keys_str_mv | AT maohuasun securetwopartylinesegmentsintersectionschemeanditsapplicationinprivacypreservingconvexhullintersection AT shoushanluo securetwopartylinesegmentsintersectionschemeanditsapplicationinprivacypreservingconvexhullintersection AT yangxin securetwopartylinesegmentsintersectionschemeanditsapplicationinprivacypreservingconvexhullintersection AT yixianyang securetwopartylinesegmentsintersectionschemeanditsapplicationinprivacypreservingconvexhullintersection |