Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2010.17C.5.399

Distributed Data Management based on t-(v,k,1) Combinatorial Design  

Song, You-Jin (동국대학교 정보경영학과)
Park, Kwang-Yong (동국대학교 전자상거래협동)
Kang, Yeon-Jung (한국인터넷진흥원 인터넷융합 정책본부)
Publication Information
The KIPS Transactions:PartC / v.17C, no.5, 2010 , pp. 399-406 More about this Journal
Abstract
Many problems are arisen due to the weakness in the security and invasion to privacy by malicious attacker or internal users while various data services are available in ubiquitous network environment. The matter of controlling security for various contents and large capacity of data has appeared as an important issue to solve this problem. The allocation methods of Ito, Saito and Nishizeki based on traditional polynomial require all shares to restore the secret information shared. On the contrary, the secret information can be restored if the shares beyond the threshold value is collected. In addition, it has the effect of distributed DBMS operation which distributes and restores the data, especially the flexibility in realization by using parameters t,v,k in combinatorial design which has regularity in DB server and share selection. This paper discuss the construction of new share allocation method and data distribution/storage management with the application of matrix structure of t-(v,k,1) design for allocating share when using secret sharing in management scheme to solve the matter of allocating share.
Keywords
t-(v,k,1) Design; Share Allocation; Distribution/Storage Management;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Beth, D. Jungnickel, and H. Lenz, “Design theory,” Cambridge Univ. Press, 1993.
2 J. Benaloh and J. Letchter, “Generalized secret sharing and monotone functions,” Advances in Cryptography-Proc. of Crypto'88, Notes Comp. Science, pp.27-35, 1990.   DOI
3 D. R. Hughes and F. C. Piper, “Design theory,” Cambridge Univ. Press, Cambidge, 1985.
4 A. Shamir, “How to share secret,” Comm. of the ACM, 22, pp.612-613, 1979.   DOI   ScienceOn
5 J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, “On a Fast (k,n)-Threshold Secret Sharing Scheme,” IEICE Trans. Fundamentals, Vol.E91-A, No.9, pp.2365-2377, Jan., 2008.   DOI   ScienceOn
6 C. Cachin, “On-line Secret Sharing," Cryptography and Coding, LNCS Vol.1025, pp.190-198, 2005.   DOI
7 Raghu Rmakrishnan, “Sherpa: Cloud Computing of the Third Kind," Data- Intensive Computing Symposium, 2008.
8 Jeff Dean, “Handling Large Datasets at Google: Current Systems and Future Directions," Data-Intensive Computing Symposium, 2008.
9 M. Ito, A. Saito, and T. Nishizeki, “Secret sharing scheme realizing general access structure,” In Proceedings of the IEEE Global Communication Conference, 1987.
10 A. Subbiah and D. M. Blough, “An approach for fault tolerant and secure data storage in collaborative work environements,” In Proc. of the 2005 ACM Workshop on Storage Security and Survivabiilty, pp.84-93, Nov., 2005.   DOI