Secure dot-product protocol using trace functions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 927-931

  Malek, Behzad ^a   Miri, Ali ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DOT-PRODUCT PROTOCOL; TRACE FUNCTIONS;

NETWORK SECURITY; SET THEORY; VECTORS;

NETWORK PROTOCOLS;

EID: 39049125653     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261795     Document Type: Conference Paper

References (14)

1. M. Abadi and J. Feigenbaum, Secure circuit evaluation. Journal of Cryptology, Volume 2, Pages 1-12, 1990.
2. Wenliang Du and Mikhail J. Atallah, Privacy-preserving statistical analysis, In the Proceedings of the 17th Annual Computer Security Applications Conference, Pages 102-110, December 2001.
3. R. Canetti, Y. Ishai, R. Kumar, M. K. Reiter, R. Rubinfeld, and R. N. Wright, Selective private function evaluation with applications to private statistics, In Neal Koblitz, editor, the 20th ACM Symposium on Principles of Distributed Computing (PODC), Pages 293-304, ACM Press, 2001.
4. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas, Efficient private matching and set intersection, In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology- EUROCRYPT 2004, Volume 3027 of Lecture Notes in Computer Science, pages 1-19, Springer-Verlag, May 2004.
5. J. Kilian, C. Cachin, J. Camenisch and J. Muller, One-round secure computation and secure autonomous mobile agents In Jose P. Rolim Ugo Montanari and Emo Welzl, editors, the 27th International Colloquium on Automata, Languages and Programming (ICALP), Volume 1853 of Lecture Notes in Computer Science, Pages 512-523, Springer-Verlag, 2000.
6. Y. Lindell and B. Pinkas, Privacy preserving data mining, In Journal of Cryptology, Volume 15, Number 3, Pages 177-206, 2002.
7. Helger Lipmaa, Bart Goethals, Sven Laur and Taneli Mielikainen, On secure scalar product computation for privacy-preserving data mining, In Choonsik Park and Seongtaek Chee, editors, In the Proceeding of the Seventh Annual International Conference in Information Security and Cryptology (ICISC 2004), Volume 3506 of Lecture Notes in Computer Science, pages 104-120, Springer- Verlag, December 2004.
8. Rudolf Lidl and Harald Niederreiter, Finite Fields, Volume 20, Cambridge University Press, New York, 1997.
9. M. Micali, O. Goldreich and A. Wigderson, How to play any mental game, In the ACM Symposium on Theory of Computing, Pages 218-229, ACM Press, 1987.
10. B. Pareneel, J. Claessens and J. Vandewalle, (How) can mobile agents do secure electronic transactions on un-trusted hosts? a survey of the security issues and the current solutions, In ACM transactions on internet technology, Volume 3, pages 28-48, February 2003.
11. T. Sander, J. Feigenbaum, M. J. Freedman and A. Shostack, Privacy engineering for digital rights management systems, In T. Sander, editor, Digital Right Management 2001 (DRM 2001), Volume 2320 of Lecture Notes in Computer Science, Pages 76-105, Springer-Verlag, 2002.
12. J. P. Stern, A new and efficient all-or-nothing disclosure of secrets protocol, In K. Ohta and D. Pei, editors, Advances in Cryptology- ASIACRYPT'98, Volume 1514 of Lecture Notes in Computer Science, Pages 357-371, Springer-Verlag, October 1998.
13. Jaideep Vaidya and Chris Clifton, Privacy preserving association rule mining in vertically partitioned data, In the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Pages 639-644, Canada, July 2002.
14. A. C. Yao, How to generate and exchange secrets (extended abstract), In Los Alamitos, editor, the 27th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Pages 162-167, October 1986.