A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Comparing information without leaking it
Communications of the ACM
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
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
Privacy-Preserving Cooperative Scientific Computations
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Privacy-Preserving Computation of Bayesian Networks on Vertically Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
A Hybrid Technique for Private Location-Based Queries with Database Protection
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Small, stupid, and scalable: secure computing with faerieplay
Proceedings of the fifth ACM workshop on Scalable trusted computing
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
A secure protocol for point-segment position problem
WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
A privacy preserving system for friend locator applications
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Information theoretical analysis of two-party secret computation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Point-based trust: define how much privacy is worth
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Secrecy of two-party secure computation
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Distributed data mining protocols for privacy: a review of some recent results
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Location privacy for cellular systems; analysis and solution
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Research on secure multi-party computational geometry
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
A Semantics-based Approach to Large-Scale Mobile Social Networking
Mobile Networks and Applications
Study of a fuzzy comprehensive evaluation problem in cloud computing
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Private proximity testing with an untrusted server
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Private proximity detection for convex polygons
Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess
| Hi-index | 0.00 |
The general secure multi-party computation problem is when multiple parties (say, Alice and Bob) each have private data (respectively, a and b) and seek to compute some function f(a, b) without revealing to each other anything unintended (i.e., anything other than what can be inferred from knowing f(a, b)). It is well known that, in theory, the general secure multi-party computation problem is solvable using circuit evaluation protocols. While this approach is appealing in its generality, the communication complexity of the resulting protocols depend on the size of the circuit that expresses the functionality to be computed. As Goldreich has recently pointed out [6], using the solutions derived from these general results to solve specific problems can be impractical; problem-specific solutions should be developed, for efficiency reasons. This paper is a first step in this direction for the area of computational geometry. We give simple solutions to some specific geometric problems, and in doing so we develop some building blocks that we believe will be useful in the solution of other geometric and combinatorial problems as well.