1. 1. R.Agrawal and R.Srikant, “Fast algorithms for mining association rules in large databases,” In VLDB, pages 487– 499, 1994.
   2. D.Beaver, S. Micali, and P.Rogaway, “The round complexity of secure protocols,” In STOC, pages 503–513, 1990.
   3. M.Bellare, R. Canetti, and H. Krawczyk, “Keying hash functions for message authentication,” In Crypto, pages 1– 15, 1996.
   4. A. Ben-David, N. Nisan, and B. Pinkas, “FairplayMP - A system for secure multi-party computation” In CCS, pages 257–266, 2008.
   5. J.Brickell and V.Shmatikov, “Privacy-preserving graph algorithms in the semi-honest model,” In ASIACRYPT, pages 236–252, 2005.
   6. Rajkumar.S, V.Elavaras, “A fast distributed algorithm for mining association rules,” In PDIS, pages 31–42, 1996
   7. Tamir Tassa, D.W.L Cheung, V.T.Y. Ng, A.W.C. Fu, and Y. Fu., “Efficient mining of association rules in distributed databases,” IEEE Trans. Knowl. Data Eng., 8(6):911–922, 1996
   8. S.Pavithra, P.Prasanna, “A novel secure multiparty algorithms in horizontally distributed database for fast distributed database,” 24:106–110, 1978.
   9. Bollu Jyothi, K.Venkateswara Rao, “Secure Mining of Association Rules in Horizontally Distributed Databases” (Protecting Sensitive Labels in Social Network Data Anonymization) pages 639–644, 2002.
   10. N.Kowsalya, M. Saraswath, “Privacy Preserving and Secure Mining of Association Rules in Distributed Data Base,” pages 139–147, 2005.