Secure two-party point-circle inclusion problem

Authors:
Yong-Long Luo;Liu-Sheng Huang;Hong Zhong
Affiliations:
Department of Computer Science, University of Science and Technology of China, Hefei, China and Department of Computer Science, Anhui Normal University, Wuhu, China and Anhui Province Key laborato ...;Department of Computer Science, University of Science and Technology of China, Hefei, China and Anhui Province Key laboratory of Software in Computing and Communication, Hefei, China;Department of Computer Science, University of Science and Technology of China, Hefei, China and Anhui Province Key laboratory of Software in Computing and Communication, Hefei, China
Venue:
Journal of Computer Science and Technology
Year:
2007

Citing 11
Cited 4

A new public key cryptosystem based on higher residues

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
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
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
A practical approach to solve Secure Multi-party Computation problems

Proceedings of the 2002 workshop on New security paradigms
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters

IEEE Transactions on Computers
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
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An efficient solution to the millionaires' problem based on homomorphic encryption

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
On private scalar product computation for privacy-preserving data mining

ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology

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
Security analysis of the Louis protocol for location privacy

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Approximate and exact hybrid algorithms for private nearest-neighbor queries with database protection

Geoinformatica
Research on secure multi-party computational geometry

ICICA'11 Proceedings of the Second international conference on Information Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly.