Privacy-preserving algorithms for distributed mining of frequent itemsets

DOI10.1016/j.ins.2006.08.010zbMath1142.68488OpenAlexW2043417095MaRDI QIDQ867633

Sheng Zhong

Publication date: 16 February 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.08.010

zbMATH Keywords

privacydata miningassociation rulesdistributed databases

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

Towards the evaluation of time series protection methods ⋮ Protecting data: a fuzzy approach ⋮ Two methods for privacy preserving data mining with malicious participants ⋮ Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations ⋮ PRIVACY-PRESERVING SVD-BASED COLLABORATIVE FILTERING ON PARTITIONED DATA ⋮ Privacy-preserving health data collection for preschool children ⋮ Symmetric cryptographic protocols for extended millionaires' problem ⋮ A communication-efficient private matching scheme in client-server model ⋮ \(k\)-anonymous data collection

Uses Software

• GeneScout

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Fuzzy reasoning model under quotient space structure
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Information and Communications Security
• Data and Applications Security XIX
• Privacy preserving data mining

This page was built for publication: Privacy-preserving algorithms for distributed mining of frequent itemsets