How to deal with malicious users in privacy‐preserving distributed data mining
From MaRDI portal
Publication:3497744
DOI10.1002/sam.10029zbMath1178.68224MaRDI QIDQ3497744
Publication date: 27 July 2009
Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sam.10029
68T05: Learning and adaptive systems in artificial intelligence
68P25: Data encryption (aspects in computer science)
Related Items
Cites Work
- Definitions and properties of zero-knowledge proof systems
- Player simulation and general adversary structures in perfect multiparty computation
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- Efficient noise-tolerant learning from statistical queries
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Theory of Cryptography
- Privacy preserving data mining
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item