Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
From MaRDI portal
Publication:657907
DOI10.1016/J.JCSS.2011.02.004zbMATH Open1232.68032OpenAlexW2021668342MaRDI QIDQ657907FDOQ657907
Elisa Bertino, Alfredo Cuzzocrea
Publication date: 11 January 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.02.004
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Differential Privacy: A Survey of Results
- A security machanism for statistical database
- Title not available (Why is that?)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Foundations of Cryptography
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flexible support for multiple access control policies
- A cubic-wise balance approach for privacy preservation in data cubes.
- Auditing and Inference Control in Statistical Databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Security of statistical databases
- Specifying OLAP cubes on XML data
Uses Software
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)
