Secure two-party computational geometry

Journal of Computer Science and Technology

Volumn 20, Issue 2, 2005, Pages 258-263

  Li, Shun Dong ^a   Dai, Yi Qi ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Millionaire problem; Oblivious transfer; Protocol; Secure computation geometry; Secure multi party computation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CRYPTOGRAPHY; INTERNET; NETWORK PROTOCOLS; PROBLEM SOLVING; STATISTICAL METHODS; THEOREM PROVING;

MILLIONAIRE PROBLEMS; OBLIVIOUS TRANSFER; SECURE COMPUTATION GEOMETRY; SECURE MULTI-PARTY COMPUTATION;

COMPUTATIONAL GEOMETRY;

EID: 18244384471     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-005-0258-z     Document Type: Conference Paper

References (16)

1. Wenliang Du, Mikhail J Atallah. Secure multi-party computation problems and their applications: A review and open problems. In New Security Paradigma Workshop 2001, September 11-13, 2001, Cloudcroft, New Mexico, USA., pp.11-20. Available at http://www.cis.syr.edu/wedu/Research/publication.html
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.
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.
4. Oded Goldreich, Silvio Micali, Avi Wigderson. How to play any mental game. In Proc. the 19th Annual ACM Confer ence on Theory of Computing, ACM Press, New York, 1987, pp.218-229.
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.
6. Lindeil Y. Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology, 2003, 16(3): 143-184.
7. Goldreich O. Secure multi-party computation (working draft). Available at http://www.wisdom.weizmann.ac.il/home/oded/publichtml/foc.html, 2002.
8. Lindell Y, Pinkas B. Privacy preserving data mining. Journal of Cryptology, 2002, 15(3): 177-206.
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.
10. Ronald Fagin, Moni Naor, Peter Einkler. Comparing information without leaking it. Communications of the ACM, 1996, 39(5): 77-85.
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.
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.
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 http://www.cis.syr.edu/wedu/ Research/publication.html
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.
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.
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.