CN102685199B

CN102685199B - A kind of file safety storage method of multinode Network Based

Info

Publication number: CN102685199B
Application number: CN201210015433.5A
Authority: CN
Inventors: 吴昊; 陆青; 蒋志航; 代飞; 陈宏欣; 冯小辉
Original assignee: Nanjing Communications Institute of Technology
Current assignee: Nanjing Communications Institute of Technology
Priority date: 2012-01-18
Filing date: 2012-01-18
Publication date: 2015-09-02
Anticipated expiration: 2032-01-18
Also published as: CN102685199A

Abstract

A file safety storage method for multinode Network Based, comprises the separate memory node number N that acquisition has possessed, described separate give away secrets for any node or damage all the other nodes can not be caused to give away secrets or damage; Original document is encrypted; According to memory node quantity N, encrypt file is cut into N (N-1)/2 file sheet, every sheet size is any, and is numbered each file sheet; File sheet is stored in N number of node, every node stores N-1 sheet, and make between any two nodes, all have a file sheet identical, and each file sheet occurs altogether twice in whole node, namely the memory space that each node is total is the twice of original document size, and in any two nodes, the code distance of stored file numbering is 1.Thus solve the problem that during existing network file stores, fail safe is not enough or redundancy is excessive, when ensureing minimum redundancy, give the file division storage algorithm of Maximum Safety.

Description

A kind of file safety storage method of multinode Network Based

Technical field

The present invention relates to a kind of file safety storage method of multinode Network Based.

Background technology

The storage means of existing classified papers mainly adopts the mode of cryptographic storage to realize, and this mode is preserved, if once in memory node data be stolen, then data will there is a strong possibility gives away secrets; If be divided into n sheet, store respectively in n node, once any node lost efficacy because of any reason, then data cannot be recovered; If every sheet is copied many parts, then add total memory space on the one hand, on the other hand, if obtain the data of several node, then probably cause file to be given away secrets, reduce fail safe.

Summary of the invention

Its object of the present invention is just the file safety storage method providing a kind of multinode Network Based, thus solve the problem that during existing network file stores, fail safe is not enough or redundancy is excessive, when ensureing minimum redundancy, give the file division storage algorithm of Maximum Safety.

Realize above-mentioned purpose and the technical scheme taked, comprise

(1) obtain the separate memory node number N that possessed, described separate give away secrets for any node or damage all the other nodes can not be caused to give away secrets or damage;

(2) original document is encrypted;

(3) according to memory node quantity N, encrypt file is cut into N (N-1)/2 file sheet, every sheet size is any, and is numbered each file sheet;

(4) file sheet is stored in N number of node, every node stores N-1 sheet, and make between any two nodes, all have a file sheet identical, and each file sheet occurs altogether twice in whole node, namely the memory space that each node is total is the twice of original document size, and in any two nodes, the code distance of stored file numbering is 1.

Compared with prior art the present invention has the following advantages.

1, a large amount of memory node can be adapted to and carry out the network storage;

2, effectively can resist inside to divulge a secret and network hacker invasion, be not more than N-2 (containing N-2) as long as invade nodes in N number of memory node, all cannot utilize node Chinese pieces synthesis original document, file is all safe in theory;

3, any one node lost efficacy because of any reason, and data all can not be caused to recover, and can restore the unique file sheet constituted mode of this node by all the other nodes;

4, by any N-1 node, all original document can be restored.

Accompanying drawing explanation

Below in conjunction with accompanying drawing, the invention will be further described.

Fig. 1 is the inventive method flow chart;

Fig. 2 is file slice encode algorithm flow chart of the present invention.

Embodiment

As shown in Figure 1, comprise

(2) original document is encrypted;

As shown in Figure 2, described file slice encode algorithm is as follows:

obtain memory node number N;

define arrays a [N] [N-1] be used for collecting file sheet numbering (index bound is a [0] [0] ~ a [N-1] [N-2]) that every node stores, the span of array is node Chinese pieces numbering 1 ~ N (N-1)/2;

initialization row, column subscript and file sheet numbering, represent with i, j, m respectively, and i=0, m=1;

if i>=N-1, jump to

j=i；

if j is >=N-1, jump to

value in a [i] [j] and a [j+1] [i] is set to m;

m=m+1; J=j+1; Jump to

i=i+1, jumps to

complete file slice encode, a [0] ~ a [N-1] respectively in corresponding N number of node deposit the numbering of file sheet.

The present invention proposes the file safety storage method of multinode Network Based, and specific features comprises the following steps: (as shown in Figure 1)

1, the separate memory node number N possessed is obtained, the numerical value of N is larger, then storage security is higher, can't cause the raising of general act memory space simultaneously, and " separate " refers to that any node is given away secrets or damaged all the other nodes can not be caused to give away secrets or damage here;

2, original document is encrypted with existing known way;

3, according to memory node quantity N, encrypt file is cut into N (N-1)/2 file sheet, every sheet size is any, and is numbered each file sheet, attention: file must be divided into N (N-1)/2 slice, this is minimal redundancy dividing method;

4, file sheet is stored in N number of node, every node stores N-1 sheet, and make between any two nodes, all have a file sheet identical, and each file sheet occurs altogether twice in whole node, namely the memory space that each node is total is the twice of original document size, and in any two nodes, the code distance of stored file numbering is 1.File slice encode algorithm following (flow chart is shown in Fig. 2):

obtain memory node number N;

if i>=N-1, jump to

j=i；

if j is >=N-1, jump to

value in a [i] [j] and a [j+1] [i] is set to m;

m=m+1; J=j+1; Jump to

i=i+1, jumps to

Embodiment

Existence conditions: have N number of strange land memory device, the file that a need to be keep secret stores, embodiment is following (following

Example is in N=5):

1, use existing compressed software as ZIP by the mode arranging password file, carry out burst compression, file is divided into S=N (N-1)/2 slice, respectively called after Z (1), Z (2) ..., Z (S), as N=5, the total tablet number of file division is S=5 (5-1)/2=10 sheet, be numbered Z (1) Z (1), Z (2) ..., Z (10);

2, be stored in N number of node by file sheet, every node stores N-1 sheet, and makes all have a file sheet identical between any two nodes, and each file sheet occurs and only occurs twice in each node.By following algorithm, but be not limited to following algorithm by the grouping of file sheet, for C language, if memory node number is 5:

main()

{

The quantity of #define N 5 // definition strange land memory device

Int a [N] [N-1]; // creating an array, subscript 0 is row, and subscript 1 is row, the reference number of a document that every line display memory node stores

Int i, j, m; //i, j is respectively ranks subscript, and m is reference number of a document

M=1; // put reference number of a document initial value

For (i=0; I<N-1; I++) // and below assignment is carried out to array, respective file numbering is put in corresponding array

for(j=i;j<N-1;j++)

{

a[i][j]=m;

a[j+1][i]=m;

m++;

}

For (i=0; I<N; I++) // display file sheet grouping situation, the file sheet that every behavior node is preserved

{

for(j=0;j<N-1;j++)

printf("%5d",a[i][j]);

printf("\n");

}

Operation result is as follows:

1 2 3 4

1 5 6 7

2 5 8 9

3 6 8 10

4 7 9 10

Show:

1st memory node stores { Z (1), Z (2), Z (3), Z (4) }

2nd memory node stores { Z (1), Z (5), Z (6), Z (7) }

3rd memory node stores { Z (2), Z (5), Z (8), Z (9) }

4th memory node stores { Z (3), Z (6), Z (8), Z (10) }

5th memory node stores { Z (4), Z (7), Z (9), Z (10) }.

Claims

1. a file safety storage method for multinode Network Based, is characterized in that, comprises

(2) original document is encrypted;

(3) according to memory node quantity N, encrypt file is cut into N (N-1)/2 file sheet, every sheet size is any, and is numbered each file sheet, and its number value is 1 ~ N (N-1)/2;

2. the file safety storage method of a Ju a kind of multinode Network Based according to claim 1, is characterized in that, described file sheet number algorithm is as follows:

obtain memory node number N, in following array index, the value of N and N-1 is the value of memory node number N and N-1;

define arrays a [N] [N-1] be used for collecting the file sheet numbering that every node stores, index bound is a [0] [0] ~ a [N-1] [N-2], and the span of array is node Chinese pieces numbering 1 ~ N (N-1)/2;

initialization row, column subscript and file sheet numbering, represent with i, j, m respectively, and definition initial value i=0, m=1;

if i>=N-1, jump to ;

j=i；

if j is >=N-1, jump to ;

value in a [i] [j] and a [j+1] [i] is set to m;

m=m+1; J=j+1; Jump to ;

i=i+1, jumps to ;

complete file slice encode, now in a array, first dimension subscript value 0 ~ N-1, represents the N number of node being used for storage file sheet respectively, and second dimension subscript 0 ~ N-2, represents the memory cell in each memory node respectively, and the numerical value preserved in array is file sheet numbering.