Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
From MaRDI portal
Publication:657907
Recommendations
- Privacy preserving association rules mining based on secure two-party computation
- Privacy preserving data mining by cyptography
- scientific article; zbMATH DE number 1759770
- Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
- Privacy preserving data mining
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1951148 (Why is no real title available?)
- scientific article; zbMATH DE number 2017842 (Why is no real title available?)
- scientific article; zbMATH DE number 1871283 (Why is no real title available?)
- scientific article; zbMATH DE number 805117 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- A cubic-wise balance approach for privacy preservation in data cubes.
- A security machanism for statistical database
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Auditing and Inference Control in Statistical Databases
- Differential Privacy: A Survey of Results
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Flexible support for multiple access control policies
- Foundations of Cryptography
- Security of statistical databases
- Specifying OLAP cubes on XML data
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
This page was built for publication: Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657907)