Research on secure multi-party computational geometry

Authors:
Tao Geng;Shoushan Luo;Yang Xin;Xiaofeng Du;Yixian Yang
Affiliations:
Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China;Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China;Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China;Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China;Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 10
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
Multi party computations: past and present

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient private bidding and auctions with an oblivious third party

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Secure multi-party computation problems and their applications: a review and open problems

Proceedings of the 2001 workshop on New security paradigms
Secure Multi-party Computational Geometry

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Secure two-party computational geometry

Journal of Computer Science and Technology
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Secure two-party point-circle inclusion problem

Journal of Computer Science and Technology
Privacy-Preserving Protocols for String Matching

NSS '10 Proceedings of the 2010 Fourth International Conference on Network and System Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

With rapid growth of the internet, a plenty of collaboration opportunities exist when organizations and individuals share information or cooperate to compute in a distributed system. The cooperation may occur between mutually untrusted parties or competitors. This problem is referred to Secure Multi-party Computation (SMC) problem. Secure multi-party computational geometry (SMCG) is a new field of SMC. Due to the widely potential applications, the research of SMCG becomes more and more attractive. In this paper, research frameworks of SMCG are demonstrated. From an applied viewpoint, some basic and key techniques for building secure protocols to solve SMCG problems are described. At the same time, future research orientations of the SMCG are proposed in the end.