An Improvement on a Non-deterministic One-to-n Substitution Scheme in Outsourcing Association Rule Mining

Encrypting transactional data is necessary to outsource association rule mining for the purpose of privacy preserving. However encryption transformation would affect the efficiency which is another concerned aspect of the delivering process. This paper proposes an improvement on an existed substitution cipher encryption algorithm: non-deterministic one-to-n item mapping. The new transformation is more efficient while it is still valid and secure not be covered by one-to-one mappings. Both theoretical analysis and experiments validate our work.