CAJ | 학술논문

针对分布式数据存储中空间效率低、计算复杂度高等问题，基于 Jordan 矩阵和拉格朗日差值公式，提出了一种一般访问结构上高效的分布式数据存储方案。方案是计算安全的，空间利用率与理论安全的方案相比提高了 m2倍，每个存储服务器只需维护长度很短的秘密份额，就可以实现大数据的分布式存储。在数据存储过程中，存储服务器根据双线性对的性质计算并贡献影子份额，确保秘密份额的安全性。方案具有可公开验证性，有效防止了数据分发者与存储服务器的欺骗。最后对方案的正确性、安全性、拓展性、空间效率等进行分析，表明方案在分布式数据安全存储中具有很好的应用前景。
침대분포식수거존저중공간효솔저、계산복잡도고등문제，기우 Jordan 구진화랍격랑일차치공식，제출료일충일반방문결구상고효적분포식수거존저방안。방안시계산안전적，공간이용솔여이론안전적방안상비제고료 m2배，매개존저복무기지수유호장도흔단적비밀빈액，취가이실현대수거적분포식존저。재수거존저과정중，존저복무기근거쌍선성대적성질계산병공헌영자빈액，학보비밀빈액적안전성。방안구유가공개험증성，유효방지료수거분발자여존저복무기적기편。최후대방안적정학성、안전성、탁전성、공간효솔등진행분석，표명방안재분포식수거안전존저중구유흔호적응용전경。
Focusing on the problem of low space efficiency and high computational complexity in distributed network, this pa-per proposed a scheme of high space efficiency in distributed data storage on general access structure based on the theory of Jordan matrix and the formulary of Lagrange differential.This scheme was computational secure, which improved the efficiency of m2 times compared to those which were theoretical secure.Each storage server could share a long secret with each of them keeping a short share.In the process of data storing, storage server just computed and contributed the shadow according to the theory of bilinear pairing, assuring the safety of the share.The scheme was publicly verifiable, so cheating between secret dis-tributer and storage server was avoided.In the end, it analyzed the validity, security, expansibility and space efficiency of the scheme.The result indicates that the scheme can be of good use in secure distributed storage.