Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2014 (2014), Article ID 178585, 11 pages
http://dx.doi.org/10.1155/2014/178585
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.

Linked References

  1. Y. Kim, F. Maino, M. Narasimha, K. H. Rhee, and G. Tsudik, “Secure group key management for storage area networks,” IEEE Communications Magazine, vol. 41, no. 8, pp. 92–99, 2003. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Armbrust, A. Fox, R. Griffith et al., “Above the clouds: a Berkeley view of cloud computing,” Tech. Rep., University of California, Berkeley, Calif, USA, 2009. View at Google Scholar
  3. J. Kubiatowicz, D. Bindel, Y. Chen et al., “Oceanstore: an architecture for global-scale persistent storage,” in Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 190–201, ACM Press, Cambridge, Mass, USA, 2000.
  4. A. Adya, W. J. Bolosky, M. Castro et al., “FARSITE: federated, available, and reliable storage for an incompletely trusted environment,” in Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI '02), pp. 1–14, Boston, Mass, USA, December 2002.
  5. A. Rowstron and P. Druschel, “Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility,” in Proceedings of the 18th ACM Symposium on Operating Systems Principles, pp. 188–201, Alberta, Canada, 2001.
  6. E. Gheringer, “Choosing passwords: security and human factors,” Proceedings of IEEE, vol. 90, pp. 369–373, 2002. View at Google Scholar
  7. R. W. Proctor, M.-C. Lien, K.-P. L. Vu, E. E. Schultz, and G. Salvendy, “Improving computer security for authentication of users: influence of proactive password restrictions,” Behavior Research Methods, Instruments, and Computers, vol. 34, no. 2, pp. 163–169, 2002. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Riley, “Password security: what users know and what they actually do,” Usability News, vol. 8, no. 1, 2006. View at Google Scholar
  9. M. O. Rabin, “Efficient dispersal of information for security, load balancing, and fault tolerance,” Journal of the ACM, vol. 36, no. 2, pp. 335–348, 1989. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Subbiah and D. M. Blough, “An approach for fault tolerant and secure data storage in collaborative work environments,” in Proceedings of the ACM Workshop on Storage Security and Survivability (StorageSS '05), pp. 84–93, November 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Shamir, “How to share a secret,” Communications of the Association for Computing Machinery, vol. 22, no. 11, pp. 612–613, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. G. R. Blakley, “Safeguarding cryptographic key,” in Proceedings of the National Computer Conference, pp. 313–317, Springer, Montvale, NJ, USA, 1979.
  13. K. Greenan, M. Storer, E. L. Miller, and C. Maltzahn, “POTSHARDS: storing data for the long-term without encryption,” in Proceedings of the 3rd IEEE International Security in Storage Workshop (SISW '05), pp. 12–20, San Francisco, Calif, USA, December 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Storer, K. Greenan, E. Miller, and K. Voruganti, “POTSHARDSa secure, recoverable, long-term archival storage system,” ACM Transactions on Storage, vol. 5, no. 2, pp. 1–35, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. L. Kocarev and G. Jakimoski, “Logistic map as a block encryption algorithm,” Physics Letters A, vol. 289, no. 4-5, pp. 199–206, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. G. Jakimoski and L. Kocarev, “Differential and linear probabilities of a block-encryption cipher,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 50, no. 1, pp. 121–123, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. G. Jakimoski and L. Kocarev, “Chaos and cryptography: block encryption ciphers based on chaotic maps,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 48, no. 2, pp. 163–169, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. A. Parakh and S. Kak, “Online data storage using implicit security,” Information Sciences, vol. 179, no. 19, pp. 3323–3331, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Parakh and S. Kak, “Space efficient secret sharing for implicit data security,” Information Sciences, vol. 181, no. 2, pp. 335–341, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. A. Parakh and W. Mahoney, “Privacy preserving computations using implicit security,” in Proceedings of the 22nd International Conference on Computer Communication and Networks (ICCCN '13), pp. 1–6, August 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. Z. Chen, W. Yao, D. Xiao, C. Wu, J. Liu, and C. Wang, “ESSA: an efficient and secure splitting algorithm for distributed storage systems,” China Communications, vol. 7, no. 4, pp. 89–95, 2010. View at Google Scholar · View at Scopus
  22. M. Löbbing and I. Wegener, “The number of knight’s tours equals 33,439,123,484,294–counting with binary decision diagrams,” The Electron Journal of Combinatorics, vol. 3, no. 1, 1996. View at Google Scholar
  23. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st annual ACM symposium on Theory of Computing (STOC '09), pp. 169–178, ACM, Bethesda, Md, USA, 2009. View at Google Scholar · View at MathSciNet
  24. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS '12), pp. 309–325, January 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. C. Gentry, “Computing arbitrary functions of encrypted data,” Communications of the ACM, vol. 53, no. 3, pp. 97–105, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Proceedings of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques (EUROCRYPT '10), pp. 24–43, 2010. View at Publisher · View at Google Scholar
  27. D. Micciancio, “A first glimpse of cryptography's Holy Grail,” Communications of the ACM, vol. 53, no. 3, p. 96, 2010. View at Publisher · View at Google Scholar · View at Scopus
  28. G. Kaddoum, F. Gagnon, and F. Richardson, “Design of a secure Multi-Carrier DCSK system,” in Proceedings of the 9th International Symposium on Wireless Communication Systems (ISWCS '12), pp. 964–968, IEEE, Paris, France, August 2012. View at Publisher · View at Google Scholar · View at Scopus
  29. G. Kaddoum and F. Gagnon, “Error correction codes for secure chaos-based communication system,” in Proceedings of the 25th Biennial Symposium on Communications (QBSC '10), pp. 193–196, May 2010.
  30. Z.-L. Zhu, C. Wang, H. Chai, and H. Yu, “A chaotic image encryption scheme based on magic cube transformation,” in Proceedings of the 4th International Workshop on Chaos-Fractals Theories and Applications (IWCFTA '11), 2011.
  31. L. Zhang, X. TiaN, and S. Xia, “Scrambling algorithm of image encryption based on Rubik's cube rotation and logistic sequence,” in Proceedings of the International Conference on Multimedia and Signal Processing (CMSP '11), pp. 312–315, Guilin, China, May 2011. View at Publisher · View at Google Scholar · View at Scopus
  32. K. Loukhaoukha, J.-Y. Chouinard, and A. Berdai, “A secure image encryption algorithm based on Rubik's cube principle,” Journal of Electrical and Computer Engineering, vol. 2012, Article ID 173931, 13 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  33. A.-V. Diaconu and K. Loukhaoukha, “An improved secure image encryption algorithm based on Rubik's cube principle and digital chaotic cipher,” Mathematical Problems in Engineering, vol. 2013, Article ID 848392, 10 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  34. R. Matthews, “On the derivation of a “chaotic” encryption algorithm,” Cryptologia, vol. 13, no. 1, pp. 29–42, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  35. D. D. Wheeler, “Problems with chaotic cryptosystems,” Cryptologia, vol. 13, pp. 243–250, 1989. View at Publisher · View at Google Scholar
  36. D. D. Wheeler and R. A. J. Matthews, “Supercomputer investigations of a chaotic encryption algorithm,” Cryptologia, vol. 15, no. 2, pp. 140–152, 1991. View at Publisher · View at Google Scholar
  37. E. Biham and A. Shamir, A Differential Cryptanalysis of the Data Encryption Standard, Springer, Berlin, Germany, 1993. View at Publisher · View at Google Scholar · View at MathSciNet