How to deal with malicious users in privacy‐preserving distributed data mining
From MaRDI portal
Publication:3497744
Recommendations
Cites work
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 1504552 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Definitions and properties of zero-knowledge proof systems
- Efficient noise-tolerant learning from statistical queries
- Efficient proofs that a committed number lies in an interval
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Player simulation and general adversary structures in perfect multiparty computation
- Privacy preserving data mining
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
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)