Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2014, Article ID 178585, 11 pages
Research Article

An Effective Privacy-Preserving Algorithm Based on Logistic Map and Rubik’s Cube Transformation

1Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing 100876, China
2School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received 24 April 2014; Revised 4 November 2014; Accepted 10 November 2014; Published 27 November 2014

Academic Editor: Daniele Fournier-Prunaret

Copyright © 2014 Wenbin Yao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Security and privacy issues present a strong barrier for users to adapt to cloud storage systems. In this paper, a new algorithm for data splitting called EPPA is presented to strengthen the confidentiality of data by two-phase process. In EPPA, data object is organized to be several Rubik’s cubes executed for several rounds transformation at the first phase. In every round, chaotic logistic maps generate pseudorandom sequences to cover the plaintext by executing Exclusive-OR operation to form the cipher. Then logistic map is used to create rotation policies to scramble data information based on Rubik’s cube transformation. At the second phase, all cubes are unfolded and combined together as a cross-shaped cube, which will be partitioned into a few data fragments to guarantee that every fragment does not contain continuous bytes. These fragments are stored on randomly chosen servers within cloud environment. Analyses and experiments show that this approach is efficient and useable for the confidentiality of user data in cloud storage system.