Journal of Computer Science and Technology

, Volume 20, Issue 2, pp 258–263 | Cite as

Secure Two-Party Computational Geometry

  • Shun-Dong LiEmail author
  • Yi-Qi Dai


Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric problems, and in doing so a building block is developed, the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.


secure multi-party computation oblivious transfer millionaire problem secure computation geometry protocol 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Wenliang Du, Mikhail J Atallah. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigms Workshop 2001, September 11–13, 2001, Cloudcroft, New Mexico, USA., pp.11–20. Available at
  2. [2]
    Mikhail J Atallah, Wenliang Du. Secure multi-party computational geometry. In 7th Int. Workshop on Algorithms and Data Structures (WADS 2001), Lecture Note in Computer Sciences 2125, Springer-Verlag, New York, 2001, pp.165–179.Google Scholar
  3. [3]
    Yao A. Protocols for secure computations. In Proc. the 23rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA., 1982, pp.160–164.Google Scholar
  4. [4]
    Oded Goldreich, Silvio Micali, Avi Wigderson. How to play any mental game. In Proc. the 19th Annual ACM Conference on Theory of Computing, ACM Press, New York, 1987, pp.218–229.Google Scholar
  5. [5]
    Goldwasser S. Multi-party computations: Past and present. In Proc. the 16th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, 1997, pp.21–24.Google Scholar
  6. [6]
    Lindell Y. Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology, 2003, 16(3): 143–184.Google Scholar
  7. [7]
    Goldreich O. Secure multi-party computation (working draft). Available at, 2002.
  8. [8]
    Lindell Y, Pinkas B. Privacy preserving data mining. Journal of Cryptology, 2002, 15(3): 177–206.Google Scholar
  9. [9]
    Rakesh Agrawal, Ramakrishnan Srikant. Privacy-preserving data mining. In Proc. the 2000 ACM SIGMOD on Management of Data, ACM Press, New York, 2000, pp.439–450.Google Scholar
  10. [10]
    Ronald Fagin, Moni Naor, Peter Einkler. Comparing information without leaking it. Communications of the ACM, 1996, 39(5): 77–85.Google Scholar
  11. [11]
    Goldwasser S, Lindell Y. Secure computation without agreement. In Proc. 16th DISC, Lecture Notes in Computer Science 2508, Springer-Verlag, New York, 2002, pp.17–32.Google Scholar
  12. [12]
    Wenliang Du, Mikhail J Atallah. Privacy-preserving cooperative scientific computation. In Proc. 14th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, Los Alamitos, CA., 2001, pp.273–282.Google Scholar
  13. [13]
    Wenliang Du, Mikhail J Atallah. Protocol for secure remote database access with approximate matching. In 7th ACM Conference on Computer and Communication Security, The First Workshop on Security and Privacy in E-Commerce, ACM Press, New York, Available at
  14. [14]
    Cachin C. Efficient private bidding and auction with an obvious third party. In Proc. the 6th ACM Conference on Computer and Communication Security, ACM Press, New York, 1999, pp.120–127.Google Scholar
  15. [15]
    Brassard G, Crepeau C, Robert J. All-or-nothing disclosure of secret. Advance in Cryptology-Crypto86, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1987, pp.234–238.Google Scholar
  16. [16]
    Wen-Guey Tzeng. Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters. IEEE Transactions on Computers, 2004, 53(2): 232–240.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingP.R. China

Personalised recommendations