Symmetric encryption solutions to millionaire's problem and its extension

2006 1st International Conference on Digital Information Management, ICDIM

Volumn , Issue , 2006, Pages 531-537

  Li, Shundong ^a   Dai, Yiqi ^b   Wang, Daoshun ^b   Luo, Ping ^b  

^a BEIJING NORMAL UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; PUBLIC KEY CRYPTOGRAPHY;

BASIC BLOCKS; NATURAL NUMBERS; REAL NUMBERS; SECURE MULTI-PARTY COMPUTATIONS; SYMMETRIC ENCRYPTIONS; SYMMETRIC KEYS;

INFORMATION MANAGEMENT;

EID: 51849166064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDIM.2007.369247     Document Type: Conference Paper

References (18)

1. A. Yao. Protocols for secure computations, in: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, Los Alamitos: IEEE Computer Society Press, 1982: 160-164.
2. Goldreich O., Micali S., Wigderson A. How to play ANY mental game. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing. New York, ACM Press, 1987, 218-229.
3. O.Goldreich. The Foundations of Cryptography-Volume 2. London: Cambridge University Press, 2004.
4. C. Cachin, Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027), New York: Springer-Verlag, 2004, 1-55, 419-473.
5. Goldwasser S. Multi-party computations: Past and present. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997, 21-24.
6. Fagin R., Naor M., Winkler P. Comparing information without leaking it. Communications of the ACM, 1996, 39(5): 77-85.
7. Lindell Y. and Pinkas B. Privacy preserving data mining. Journal of Cryptology, 2002, 15(3): 177-206.
8. Du W.L. and Atallah M.J. Privacy-preserving cooperative scientific computations. In: Proceedings of the 14th IEEE Computer Security Workshop. Los Alamitos: IEEE Computer Society Press, 2001, 273-282.
9. Du W.L., Atallah M.J. Protocol for secure remote database access with approximate matching. In the 7th ACM Conference on Computer and Communication Security, The First Workshop on Security and Privacy in E-Commerce: New York: ACM Press, 2000, available at http://www.cis.syr.edu/~wedu/Researoh/publication. html [2005-02-25]
10. Cachin C. Efficient private bidding and auction with an obvious third party. In: Proceedings of the 6th ACM Conference on Computer and Communication Security. New York: ACM Press, 1999, 120-127.
11. Du W.L., Han Y.H.S. and Chen S.G. Privacy-preserving multivariate statistical analysis: linear regression and classification. In: Proceedings of 2004 SIAM International Conference on Data Mining. Society for Industrial & Applied, 2004, pp. 222-233.
12. Atallah, J., Du, W.L. Secure multi-Party computational geometry. In: Seventh International Workshop on Algorithms and Data Structures(LNCS2125), New York: Springer-verlag, 2001, 165-179.
13. LI S.D., DAI Y.Q. Secure two-party computational geometry. Journal of Computer Science and Technology, 2005, 20(2): 258-263.
14. M.J.Freedman, K.Nissim, B.Pinkas. Efficient Private Matching and Set Intersection. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques (LNCS 3027), New York: Springer-Verlag, 2004, pp.1-19.
15. Du W.L., Atallah M.J. SMC problems and their applications: A review and open problems. In: Proceedings of New Security Paradigms Workshop 2001. New York: ACM Press, 2001, 13-22.
16. Ioannidis I., Grama A. An efficient protocol for Yao's millionaires' problem. in: Proceedings of the 36th Hawaii International Conference on System Science. Los Alamitos; IEEE Computer Society Press, 2003, 205.
17. Shundong Li, Yiqi Dai, Qiyou You. Efficient Secure Multi-party Computation Protocol for Yao's Millionaires' Problem based on set-inclusion. Progress in Natural Science, 2005, Vol.15 (9): 851-856
18. Li Shun-dong, Dai Yi-qi, You Qi-you. Efficient solution to Yao's Millionaires' problem. Electronica Sinica, Vol.33(5): 769-773, 2005.