Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion

References

• Cachin , C. 2004 . Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques . May 2–6 2004 , Interlaken, Switzerland. pp. 1 – 55 . 419 – 473 .
   Google Scholar
• Yao , A. 1982 . Protocols for secure computations . Proceeding of the 23th IEEE Symposium on Foundations of Computer Science. Nov 3–5 1982 , Chicago, USA. pp. 160 – 164 .
   Google Scholar
• Goldreich , O. , Micali , S. and Wigderson , A. 1987 . How to play ANY mental game . Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing. May 28–30 1987 , New York, USA. pp. 218 – 229 .
   Google Scholar
• Goldreich , O. Secure multi-party computation (working draft) . Available at http://www.wisdom.weizmann.ac.il/home/oded/publichtml/foc.html[2005-02-25]
   Google Scholar
• Goldwasser , S. 1997 . Multi-party computations: Past and present . Proceedings of the Sixteenth Annual ACM Symposiu, on Principles of Distributed Computing. August 21–24 1997 , Santa Barbara, California, USA. pp. 1 – 6 .
   Google Scholar
• Du , W. L. and Atallah , M. J. 2001 . Privacy-preserving cooperative scientific computations . Proceedings of 14th IEEE computer Security Workshop Nova Scotia . June 11–13 2001 , Canada. pp. 273 – 282 .
   Google Scholar
• Lindell , Y. and Pinkas , B. 2002 . Privacy preserving data mining . Journal of Cryptology , 15 ( 3 ) : 177 – 206 .
   Web of Science ®Google Scholar
• Cachin , C. 1999 . Efficient private bidding and auction with an obvious third party . Proceeding of the 6th ACM Conference on Computer and Communication Security. Nov 1–4 1999 , Singapore. pp. 120 – 127 .
   Google Scholar
• Du , W. L. and Atallah , M. J. 2000 . Protocol for secure remote database access with approximate matching . 7th ACM Conference on Computer and Communication Security, The first Work-shop on Security and Privacy in E-Commerc . Nov 2000 , Athens, Greece. Available at http://www.cis.syr.edu/∼wedu/Research/paper/ccs7-workshop.pdf[2005-02-25]
   Google Scholar
• Fagin , R. , Naor , M. and Winkler , P. 1996 . Comparing information without leaking it . Communications of the ACM , 39 ( 5 ) : 77 – 85 .
   Web of Science ®Google Scholar
• Atallah , M. J. and Du , W. L. 2001 . Secure multi-party computational geometry . Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS 2001). August 8–10 2001 , Rhode Islands, USA. pp. 165 – 179 . Providence
   Google Scholar
• Li , S. D. , Dai , Y. Q. and You , Q. Y. Secure two-party computational geometry . Journal of Computer Science and Technology , (in press)
   Google Scholar
• Ioannidis , I. and Grama , A. 2003 . An efficient protocol for Yao's millionaires' problem . Proceedings of the 36th Hawaii International Conference on System Science-2003. Jan 03–09 2003 , Hawaii, USA. pp. 205a available at http://csdl.computer.org/comp/proceedings/hicss/2003/1874/07/187470205a.pdf[2005-02-25]
   Google Scholar
• Li , S. D. , Dai , Y. Q. and You , Q. Y. Efficient solution to Yao's millionaires' problem . Journal of Electronics (in Chinese) , (in press)
   Google Scholar
• Du , W. L. , Han , Y. H.S. and Chen , S. G. 2001 . Privacy-preserving multi-variate statistical analysis: linear regression and classi-cation . Proceedings of 2004 SIAM International Conference on Data Mining. June 11–13 2001 . pp. 273 – 282 . Nova Scotia
   Google Scholar
• Du , W. L. and Atallah , M. J. 2001 . Secure multi-party computation problems and their applications: A review and open problems . Proceedings of New Security Paradigms Workshop 2001. Sep 11–13 2001 , Cloudcroft, New Mexico, USA. pp. 11 – 20 .
   Google Scholar
• Rabin , M. O. 1981 . How to exchange secrets by oblivious transfer . Technical Report TR-81, Aiken Computation Laboratoty, Harvard Univ
   Google Scholar
• Naor , M. and Pinkas , B. 2001 . Efficient oblivious transfer protocols . Proceedings of Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Jan 07–09 2001 , Washington, D.C, USA. pp. 448 – 457 .
   Google Scholar
• Tzeng , W. G. 2004 . Efficient 1-Ouit-of-n oblivious transfer schemes with universally usable parameters . IEEE Transactions on Computers , 53 ( 2 ) : 232 – 240 .
   Web of Science ®Google Scholar
• Schneier , B. 1996 . “ Applied Cryptography ” . In , 2nd Ed. , 395 – 396 . Newyork : John Wiley Inc .
   Google Scholar