A study of secure multi-party elementary function computation protocols

ACM International Conference Proceeding Series

Volumn 85, Issue , 2004, Pages 5-12

  Luo, Wenjun ^a   Li, Xiang ^a  

^a GUIZHOU UNIVERSITY   (China)

Author keywords

Elementary function; Four operations; Private; Protocol; Secure multi party computation

Indexed keywords

COMPUTATION DOMAINS; COMPUTATION PROTOCOLS; COOPERATIVE COMPUTATION; ELEMENTARY FUNCTION; PRIVATE PROTOCOLS; SECURE MULTI-PARTY COMPUTATION; TWO-PARTY COMPUTATION;

COMPETITION; INTERNET PROTOCOLS;

NETWORK SECURITY;

EID: 77952948723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1046290.1046293     Document Type: Conference Paper

References (29)

1. th IEEE Symposium on Foundations of Computer Science, pages 162-167,1986.
2. th annual ACM Symposium on theory of computing, pages 218-229, 1987.
3. O. Goldreich. Secure multi-party computation (working draft). Available from http://www.wisdom.weizmann, zc.il /home/oded/public-html/foc.html, 1998.
4. S. Even, O. Goldreich and A. Lempel. A randomized protocol for using contracts. Communications of the ACM. 28: 637-647,1985.
5. G Brassard, C. Crepeau and J. Robert. All-or-nothing disclosure of secrets. In Advances in Cryptology Crypto86, Lecture Notes in Computer Science, volume 234-238, 1987.
6. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation (extended abstract). In proceedings of the 31th ACM symposium on theory of Computing. pages 245-254, Atanta, GA, USA, May 1-4 1999.
7. Mikhail J. Atallah and W. Du. Secure multiparty computational geometry. In WADS2001: Seventh International WorLvhop on Algorithms and data Structures, pages 165-179, Providence, Rhode Island, USA, Ausust 8-10 2001.
8. Wenliang Du. A Study of Several Specific Secure Two-party Computation Problems, Ph.D. Thesis. Purdue University. 2000. Available From: htttp://www.cis.edu/~wedu/Research/publication.html
9. W. Du and Mikhail J. Atallah. Privacy-Preserving Cooperative Statistical Analysis. In 2001 ACSAC: Annual Computer Security Applications Conference .December 10-14, 2001, New Orleans, Louisiana, USA. Pages 102-110.
10. Y. Lindell. On the Composition of Secure Multi-party Protocols. Ph.D. Thesis. Department of Computer Science and Applied Mathematics, The Weizmann lnstitiute of Science, Israel, 2002. Available from http://www.research.ibm.com/ people/1/.
11. C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polyogarithmic communication. Advances in cryptology: EUROCRYPT 1999. Lecture Notes in computer, Pages 308-318, 1998.
12. B. Chor and N. Gilboa. Computationally private information retrieval (extended abstract). In Proceedings of Twenty-ninth ACM Symposium on Theory of Computing, E1 Paso, Texas, USA, MAY 4-6 1997.
13. B. Chor, N. Gilboa and M.Naor. Private information retrieval by keywords. Technical Report TR CS0917,Department of Computer Science, Technion, 1997.
14. Werdiang Du. and Mikhail J. Atallah. Privacy-Preserving Cooperative Scientific Computations. In 14th IEEE Computer Security Foundations Workshop, June 11-13 2001, Nova Scotia, Canada. Pages 273-282.
15. M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of SODA 2001(SIAM Symposium on Discrete Algorithms), Jaruary 7-9 2001, Washington DC
16. M. Naor and B. Pinkas. Distributed Oblivious Transfer. Advances in Cryptology - Asiacrypt '00 Proceedings, LNCS 1976, Springer-Verlag, pp. 200-219,December 2000.
17. M. Naor and B. Pinkas. Oblivious Transfer with adaptive queries. Advances in Cryptology - Crypto '99 Proceedings, Lncs 1666, springer-Veringer, pp. 573-590, August 1999.
18. S. Goldwasser. Multi-party computations: Past and present. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, Santa barbara, CA USA, August 21-24 1997.
19. Ueli Maurer. Secure Multi-Party Computation Made Simple. Third Conference on Security in Communication Networks, Lecture Notes in Computer Science, Springer-Verlag, Oct 2002.
20. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report Technical Memo TR-81, Aiken Computation Laboratory, 1981.
21. C. Crépeau. Equivalence between two flavors of oblivious transfers. In Advances in Cryptology - CRYPTO 1987, Lecture Notes in Computer Science, Volume 293, pages 350-354. Springer-Verlag, 1988.
22. th Annual IEEE Symposium on Foundations of Computer Science,1982.
23. Luo Wenjun, Li Xiang. A Study of secure multi-party statistical analysis. IEEE 2003 Computer Networks and Mobile Computing. Oct. 2003. 377-383.
24. Yang Bo, Chen Kai. Unconditionally-Secure Oblivious Transfer. Chinese Journal of Computers Feb.2003, Vol. 26. No. 2 202-205
25. Li Qiang, Yah Hao Chen Ke-Fei. Research and Application of Secure Multi-party Computation Protocols. Chinese Journal of computer science. 2003 Vol.30 No. 8
26. Qin J., Zhang Zhen-Feng, Feng Deng-Guo, Li Bao. A Protocol of Comparing Information Without Leaking. 2004 Journal of Software, Vol. 15, No.3
27. Luo Wenjun, Li Xiang. Secure Two-party Scientific Computations. Journal of Jishou University. Vol.24 No.4
28. Luo Wenjun, Li Xiang.Two-directional Zero-Knowledge Proof and Secure Two-Party Computation. Journal of Guizhou University 2004, Vol.21 No. 1
29. Luo Wenjun, Li Xiang. A Study of Secure Multi-party Scientific Computation Problem. Chinacrypt'2004.