How to deal with malicious users in privacy‐preserving distributed data mining
From MaRDI portal
Publication:3497744
DOI10.1002/SAM.10029zbMATH Open1178.68224OpenAlexW4243616933MaRDI QIDQ3497744FDOQ3497744
Authors: Yitao Duan, John Canny
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25)
Cites Work
- Title not available (Why is that?)
- Theory of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Foundations of Cryptography
- Title not available (Why is that?)
- Efficient noise-tolerant learning from statistical queries
- Player simulation and general adversary structures in perfect multiparty computation
- Definitions and properties of zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
- Title not available (Why is that?)
- Privacy preserving data mining
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Efficient proofs that a committed number lies in an interval
- Title not available (Why is that?)
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: How to deal with malicious users in privacy‐preserving distributed data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497744)