Privacy preserving data mining
From MaRDI portal
Publication:5917416
DOI10.1007/s00145-001-0019-2zbMath1010.94008OpenAlexW2047370889MaRDI QIDQ5917416
Publication date: 1 December 2002
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-001-0019-2
privacydata miningdecision treesoblivious transfersecure two-party computationoblivious polynomial evaluation
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (32)
Outsourced Privacy-Preserving Random Decision Tree Algorithm Under Multiple Parties for Sensor-Cloud Integration ⋮ Privacy-preserving inverse distance weighted interpolation ⋮ Privacy-preserving algorithms for distributed mining of frequent itemsets ⋮ Privacy preserving feature selection and multiclass classification for horizontally distributed data ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Secure Naïve Bayesian Classification over Encrypted Data in Cloud ⋮ Secure Computation of Inner Product of Vectors with Distributed Entries and Its Applications to SVM ⋮ Amortizing division and exponentiation ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Privacy-preserving ridge regression on distributed data ⋮ Privacy preserving linear regression modeling of distributed databases ⋮ Practical Secure Naïve Bayesian Classification Over Encrypted Big Data in Cloud ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Confidential gossip ⋮ Asynchronous privacy-preserving iterative computation on peer-to-peer networks ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ Symmetric cryptographic protocols for extended millionaires' problem ⋮ Private set-intersection with common set-up ⋮ Fast Private Norm Estimation and Heavy Hitters ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ \(k\)-anonymous data collection ⋮ Differentially-private learning of low dimensional manifolds ⋮ Privacy-Preserving Subgraph Matching Protocol for Two Parties ⋮ Efficient Secure Two-Party Exponentiation ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Oblivious polynomial evaluation and oblivious neural learning ⋮ AN IMPROVED TECHNIQUE FOR PRIVACY PRESERVING CLUSTERING BASED ON DAUBECHIES-2 WAVELET TRANSFORM ⋮ Privacy preserving electronic data gathering
This page was built for publication: Privacy preserving data mining
