메뉴 건너뛰기




Volumn , Issue , 2007, Pages 289-295

On the communication complexity of privacy-preserving information sharing protocols

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; INFORMATION ANALYSIS; NETWORK PROTOCOLS; REAL TIME SYSTEMS;

EID: 34748842035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isi.2007.379487     Document Type: Conference Paper
Times cited : (1)

References (23)
  • 8
    • 4544361334 scopus 로고    scopus 로고
    • Privacy-preserving distributed mining of association rules on horizontally partitioned data
    • M. Kantarcioglu and C. Clifton, "Privacy-preserving distributed mining of association rules on horizontally partitioned data," IEEE Transactions on Knowledge and Data Engineering, vol. 16, pp. 1026-1037, 2004.
    • (2004) IEEE Transactions on Knowledge and Data Engineering , vol.16 , pp. 1026-1037
    • Kantarcioglu, M.1    Clifton, C.2
  • 23
    • 84919085619 scopus 로고
    • An improved algorithm for computing logarithms in GF(p) and its cryptographic significance
    • S. C. Pohlig and M. E. Hellman, "An improved algorithm for computing logarithms in GF(p) and its cryptographic significance," IEEE Transactions on Information Theory, vol. 24, no. 1, pp. 106-111, 1978.
    • (1978) IEEE Transactions on Information Theory , vol.24 , Issue.1 , pp. 106-111
    • Pohlig, S.C.1    Hellman, M.E.2


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