Distributed Data Management based on t-(v,k,l) Combinatorial design


The KIPS Transactions:PartC, Vol. 17, No. 5, pp. 399-406, Oct. 2010
10.3745/KIPSTC.2010.17.5.399,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. J. Song, K. Y. Park, Y. J. Kang, "Distributed Data Management based on t-(v,k,l) Combinatorial design," The KIPS Transactions:PartC, vol. 17, no. 5, pp. 399-406, 2010. DOI: 10.3745/KIPSTC.2010.17.5.399.

[ACM Style]
You Jin Song, Kwang Yong Park, and Yeon Jung Kang. 2010. Distributed Data Management based on t-(v,k,l) Combinatorial design. The KIPS Transactions:PartC, 17, 5, (2010), 399-406. DOI: 10.3745/KIPSTC.2010.17.5.399.