On private scalar product computation for privacy-preserving data mining

Lecture Notes in Computer Science

Volumn 3506, Issue , 2005, Pages 104-120

  Goethals, Bart ^a   Laur, Sven ^b   Lipmaa, Helger ^b   Mielikäinen, Taneli ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Privacy preserving data mining; Private scalar product protocol; Vertically partitioned frequent pattern mining

Indexed keywords

COMPUTATION THEORY; DATA MINING; DATA PRIVACY; NETWORK PROTOCOLS; SECURITY OF DATA;

DATA MINIING PROTOCOL; PRIVACY-PRESERVING DATA MINING; PRIVATE SCALAR PRODUCT PROTOCOL; VERTICALLY PARTITIONED FREQUENT PATTERN MINING;

CRYPTOGRAPHY;

EID: 24944523186     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496618_9     Document Type: Conference Paper

References (22)

1. [AIR01] William Aiello, Yuval Ishai, and Omer Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In Birgit Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 119-135, Innsbruck, Austria, 6-10 May 2001. Springer-Verlag.
2. +96] Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast Discovery of Association Rules. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI/MIT Press, 1996.
3. [BB00] Jean-Fran?is Boulicaut and Artur Bykowski. Frequent Closures as a Concise Representation for Binary Data Mining. In PAKDD 2000, volume 1805 of Lecture Notes in Computer Science, pages 62-73. Springer, 2000.
4. [BBR03] Jean-Fran?is Boulicaut, Artur Bykowski, and Christophe Rigotti. Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
5. [CGS97] Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Walter Fumy, editor, Advances in Cryptology - EUROCRYPT'97, volume 1233 of Lecture Notes in Computer Science, pages 103-118, Konstanz, Germany, 11-15 May 1997. Springer-Verlag.
6. [DA01a] Wenliang Du and Mikhail J. Atallah. Privacy-Preserving Statistical Analysis. In Proceedings of the 17th Annual Computer Security Applications Conference, pages 102-110, New Orleans, Louisiana, USA, December 10-14 2001.
7. [DA01b] Wenliang Du and Mikhail J. Atallah. Protocols for Secure Remote Database Access with Approximate Matching, volume 2 of Advances in Information Security, page 192. Kluwer Academic Publishers, Boston, 2001. http://www.wkap.nl/prod/b/0-7923-7399-5.
8. [DJ01] Ivan Damgård and Mads Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Kwangjo Kim, editor, Public Key Cryptography 2001, volume 1992 of Lecture Notes in Computer Science, pages 119-136, Cheju Island, Korea, 13-15 February 2001. Springer-Verlag.
9. [DZ02] Wenliang Du and Zhijun Zhan. A Practical Approach to Solve Secure Multi-party Computation Problems. In Carla Marceau and Simon Foley, editors, Proceedings of New Security Paradigms Workshop, pages 127-135, Virginia Beach, virginia, USA, September 23-26 2002. ACM Press.
10. [FNP04] 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, Interlaken, Switzerland, 2-6 May 2004. Springer-Verlag.
11. [Gol04] Oded Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
12. [LAN02] Helger Lipmaa, N. Asokan, and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. In Matt Blaze, editor, Financial Cryptography -Sixth International Conference, volume 2357 of Lecture Notes in Computer Science, pages 87-101, Southhampton Beach, Bermuda, 11-14 March 2002. Springer-Verlag.
13. [Lip03] Helger Lipmaa. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In Chi Sung Laih, editor, Advances on Cryptology - ASIACRYPT 2003, volume 2894 of Lecture Notes in Computer Science, pages 398-415, Taipei, Taiwan, 30 November-4 December 2003. Springer-Verlag.
14. [Lip04] Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Total Communication. Technical Report 2004/063, International Association for Cryptologic Research, February 25 2004.
15. [LL04] Sven Laur and Helger Lipmaa. On Private Similarity Search Protocols. In Sanna Liimatainen and Teemupekka Virtanen, editors, Proceedings of the Ninth Nordic Workshop on Secure IT Systems (NordSec 2004), pages 73-77, Espoo, Finland, November 4-5, 2004.
16. [LL05] Sven Laur and Helger Lipmaa. Additive Conditional Disclosure of Secrets. Manuscript, January 2005.
17. [Pai99] Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Jacques Stern, editor, Advances in Cryptology -EUROCRYPT'99, volume 1592 of Lecture Notes in Computer Science, pages 223-238, Prague, Czech Republic, 2-6 May 1999. Springer-Verlag.
18. [PHM00] J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000.
19. [Pin02] Benny Pinkas. Cryptographic Techniques for Privacy-Preserving Data Mining. KDD Explorations, 4(2):12-19, 2002.
20. [VC02] Jaideep Vaidya and Chris Clifton. Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In Proceedings of The 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 639-644, Edmonton, Alberta, Canada, July 23-26 2002. ACM.
21. [vLW92] Jacobus H. van Lint and Richard M. Wilson. A Cource in Combinatorics. Cambridge University Press, 1992.
22. [WY04] Rebecca N. Wright and Zhiqiang Yang. Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data. In Proceedings of The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 713-718, Seattle, Washington, USA, August 22-25 2004. ACM.