The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
C4.5: programs for machine learning
C4.5: programs for machine learning
Boosting the margin: A new explanation for the effectiveness of voting methods
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Data Mining and Knowledge Discovery
Privacy-preserving decision trees over vertically partitioned data
ACM Transactions on Knowledge Discovery from Data (TKDD)
Privacy-preserving backpropagation neural network learning
IEEE Transactions on Neural Networks
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Privacy-Preserving Gradient-Descent Methods
IEEE Transactions on Knowledge and Data Engineering
Privacy-Preserving SVM classification on vertically partitioned data
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Modulo reduction for paillier encryptions and application to secure statistical analysis
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Minimizing regret with label efficient prediction
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we address the issue of privacy preserving datamining. Specifically, we consider a scenario where each member j of T parties has its own private database. The party j builds a private classifier hj for predicting a binary class variable y. The aim of this paper consists in aggregating these classifiers hj in order to improve the individual predictions. Precisely, the parties wish to compute an efficient linear combinations over their classifier in a secure manner.