메뉴 건너뛰기




Volumn , Issue , 2004, Pages 563-568

k-TTP: A new privacy model for large-scale distributed environments

Author keywords

Association rule mining; Data mining; Distributed data mining; Privacy; Privacy preserving data mining; Security

Indexed keywords

ASSOCIATION RULE MINING; DISTRIBUTED DATA MINING; PRIVACY; PRIVACY-PRESERVING DATA MINING; SECURITY;

EID: 12244293654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (45)

References (11)
  • 2
    • 0023545076 scopus 로고
    • How to play any mental game - A completeness theorem for protocols with honest majority
    • O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. of STOC'87, pages 218-229, 1987.
    • (1987) Proc. of STOC'87 , pp. 218-229
    • Goldreich, O.1    Micali, S.2    Wigderson, A.3
  • 3
    • 1142282764 scopus 로고    scopus 로고
    • Privacy-preserving distributed mining of association rules on horizontally partitioned data
    • June
    • M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In Proc. of DMKD'02, June 2002.
    • (2002) Proc. of DMKD'02
    • Kantarcioglu, M.1    Clifton, C.2
  • 4
    • 12244249650 scopus 로고    scopus 로고
    • Lower bounds for concurrent self composition
    • Cambridge, Massachusetts, USA, February
    • Y. Lindell. Lower bounds for concurrent self composition. In Proc. of TCC'04, Cambridge, Massachusetts, USA, February 2004.
    • (2004) Proc. of TCC'04
    • Lindell, Y.1
  • 5
    • 84974555530 scopus 로고    scopus 로고
    • Privacy preserving data mining
    • August
    • Y. Lindell and B. Pinkas. Privacy preserving data mining. Proc. of Crypto'00, LNCS, 1880:20-24, August 2000.
    • (2000) Proc. of Crypto'00, LNCS , vol.1880 , pp. 20-24
    • Lindell, Y.1    Pinkas, B.2
  • 7
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Santiago, Chile, September
    • R. Srikant and R. Agrawal. Fast algorithms for mining association rules. In Proc. of VLDB'94, pages 487-499, Santiago, Chile, September 1994.
    • (1994) Proc. of VLDB'94 , pp. 487-499
    • Srikant, R.1    Agrawal, R.2
  • 9
    • 0242709355 scopus 로고    scopus 로고
    • Privacy preserving association rule mining in vertically partitioned data
    • Edmonton, Alberta, Canada, July
    • J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In Proc. of ACM SIGKDD'02, Edmonton, Alberta, Canada, July 2002.
    • (2002) Proc. of ACM SIGKDD'02
    • Vaidya, J.1    Clifton, C.2
  • 11
    • 33751085446 scopus 로고    scopus 로고
    • Association rule mining in peer-to-peer systems
    • November
    • R. Wolff and A. Schuster. Association rule mining in peer-to-peer systems. In Proc. ICDM'03, November 2003.
    • (2003) Proc. ICDM'03
    • Wolff, R.1    Schuster, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.