Technology of Secure File Archiving in the Uniformly Random Distributed Archive Scheme
- 1 Applied Information Engineering, Tokyo Denki University, Tokyo, Japan
- 2 Applied Information Engineering, Tokyo Denki University, Tokyo, Japan
- 3 Applied Information Engineering, Tokyo Denki University, Tokyo, Japan
Abstract
This paper investigates the security features of the distributed archive scheme named Uniformly Random Distributed Archive (URDA). It is a simple, fast and practically secure algorithm that meets the needs of confidentiality and avai l ability requirements of data. URDA cuts a file archived into fragments, and distributes each fragment into randomly selected n － k + 1 storages out of n storages. As the result, users only need to access at least k storages to recover original file, whereas stolen data from k － 1 storages cannot cover original file. Thus, archived files are nothing but sequences of a large number of fixed length fragments. URDA is proved of disappearing both characters and biased bits of original data in archived files, indicating the probabilities of both a fragment and a bit appearing at particular position are uniformly constant respectively. Yet, through running experiments, we found out the risk of likelihood that URDA might be vulnerable to bit pattern attack due to the different ratios of characters appearing in real world files. However, we solved the problem by modifying URDA with variable fragment lengths, which results in that all the bits in revealed sequences are distributed uniformly and independently at random.
- http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=39612
- P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz and D. A. Patterson, “Aid: High-Performance, Reliable Secondary Storage,” ACM Computing Surveys, Vol. 26, No. 2, 1994, pp. 145-185.
- A. Shamir, “How to Share a Secret,” Communication of ACM, Vol. 22, No. 11, 1979, pp. 612-613.
- G. Blakley, “Safeguarding Cryptographic Keys,” 1979 Proceedings of the National Computer Conference, New York, 4-7 July 1979, p. 313.
- M. O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” Journal of the ACM, Vol. 36, No. 2, 1989, pp. 335-348. doi:10.1145/62044.62050
- L. Bai, “A Strong Ramp Secret Sharing Scheme Using Matrix Projection,” Proceedings of the 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks, New York, 26-29 July 2006, pp. 652-656.
- L. Bai and X. K. Zou, “A Proactive Secret Sharing Scheme in Matrix Projection Method,” International Journal of Security and Networks, Vol. 4, No. 4, 2009, pp. 201-209.
- C. Blundo, “Alfredo de Santis and Ugo Vaccaro, Efficient Sharing of Many Secrets,” Springer Verlag, Berlin, 1993.
- J. M. He and E. Dawson, “Multistage Secret Sharing Based on One-Way Function,” Electronic Letters, Vol. 30, No. 19, 1994, pp. 1591-1592. doi:10.1049/el:19941076
- K. Wang, X. K. Zou and Y. Sui, “A Multiple Secret Sharing Scheme Based on Matrix Projection,” Proceedings of the 33rd Annual IEEE International Computer Software and Applications Conference, Seattle, 20-24 July 2009, pp. 400-405.
- A. Rowstron and P. Druschel, “Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proceeding SOSP’01 Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, Banff, 21-24 October 2001, pp. 188-201.
- A. Tallat, K. Shin, H. Lee and H. Yasuda, “Some Remarkable Property of the Uniformly Random Distributed Archive Scheme,” Advances in Information Sciences and Service Sciences, Vol. 4, No. 11, 2012, pp. 114-124.
- Cisco System, “Storage Networking 101,” Cisco System, San Jose, 2001.
- International Business Machines Corporation, “Introduction to Storage Area Networks,” 2012. http://www.redbooks.ibm.com/
- S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A scalable Content-Addressable Network”, SIGCOMM ‘01 Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp. 161-172.