CN104202412A - Image storage method and system based on multiple cloud terminals - Google Patents

Abstract

The invention discloses an image storage method and system based on multiple cloud terminals. The method includes: interference transformation is performed on a to-be-stored original image to obtain a preliminarily-encrypted image, Godel coding is used to separate the encrypted image into a certain number of sub-images, and the sub-images are stored at the cloud terminals. The method has the advantages that method storing the original image at the cloud terminal is replaced, and potential safety hazard of cloud terminal storage is solved while user image privacy protection and safety storage are achieved.

Description

A kind of picture-storage method and system based on cloudy end

Technical field

The present invention relates to picture processing field, high in the clouds and secret protection field, high in the clouds, particularly a kind of picture-storage method and system based on cloudy end.

Background technology

Along with storage system is direct-connected towards networking and distributed future development by this locality, and shared by the numerous computers on network, storage system is become and be more vulnerable to attack, static storage system often becomes assailant's preferred object relatively, reaches the object of stealing, distorting or destroying data.

High in the clouds storage is the pattern of storing on a kind of grid line, data is left in many virtual servers of conventionally being managed on behalf of another by third party, and user is the file of online management oneself whenever and wherever possible, and terminal is not had to fixing restriction, convenient and swift.But for the preservation of the privacy file of individual subscriber, can high in the clouds accomplish safety or have dispute.

Through the research in high in the clouds is found, show that high in the clouds exists potential safety hazard.First be that individual privacy is revealed hidden danger, from the viewpoint of technology and cost two, high in the clouds user's picture is to be expressly kept on high in the clouds mostly, and the manager in high in the clouds can check the picture in high in the clouds easily, and this is that user is less desirable.The data security hidden danger of next, the mass data of high in the clouds storage, allows it become the target of hacker attacks, and hacker may steal or Update Table, causes irremediable loss.

The problem that safe storage will solve has two problems, does not how guaranteeing that file data is complete reliably divulge a secret? how to guarantee only having legal user, access relevant file? solving above the core methed that two problems use is data encryption and Certificate Authority management.Yet in current picture preservation scheme safely, the mode based on file encryption, is encrypted file mostly, then decruption key is decrypted.But image ciphering is relative complex, encrypt single file simultaneously and may cause key to be lost or file damage, finally cause File lose.The protection based on to high in the clouds self mostly of the scheme of current high in the clouds safe storage, emphasizes the fail safe in high in the clouds self, with this, guarantees the data security in high in the clouds.There is again this complexity and easy loss property in data self-encryption, therefore, the picture-storage scheme of the cloudy end of a kind of safety is necessary.

Summary of the invention

The technical problem to be solved in the present invention is: a kind of picture-storage method and system based on cloudy end has solved picture safety problem beyond the clouds, single point failure problem and privacy leakage problem.

The present invention, in order to solve above-mentioned technical problem, has proposed a kind of picture-storage method and system based on cloudy end.

Technical scheme of the present invention is: a kind of picture-storage method based on cloudy end, comprises the steps:

Step 1: picture-storage step;

Step 1.1: extract the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C;

Step 1.2: convert original image to N subgraph, and constructing variable T, wherein, and the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N;

Step 1.3: to the capable Godel coding that carries out of i of the picture element matrix B after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer;

Step 1.4: according to Gi and flag structure multinomial, the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Step 1.5: for every subgraph adds secondary mark,, then the good subgraph of mark is assigned at random uniformly among a plurality of high in the clouds;

Step 2: picture recovering step:

Step 2.1: select subgraph from a plurality of high in the clouds;

Step 2.2: the subgraph of selecting is carried out to secondary mark checking, if subpicture tag is verified, retains current subgraph and enter step 2.3, otherwise, return to step 2.1 after giving up this subgraph;

Step 2.3: judge whether subgraph quantity reaches T; Be to enter step 2.4, otherwise return to step 2.1;

Step 2.4: extract the picture element matrix (P that T opens subgraph ₁, P ₂..., P _t), T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, t represents that t opens subgraph, t between 1 to T, S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into;

Step 2.5: the S obtaining according to step 2.4 _i ^tutilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

Step 2.6: open the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtain polynomial constant term, utilize Lagrange's interpolation obtain flag ‵ to be matched;

Step 2.7: flag ‵ value to be matched and former figure flag value are compared, if flag ‵ and flag not etc. time, return to step 2.1; If flag ‵=flag determines B ‵=B, enter step 2.8;

Step 2.8: B ‵ is disturbed to reduction; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC C ^-1, obtain original image.

Described step 1.4 comprises the steps:

Step 1.4.1: according to Gi structure conversion multinomial, wherein: mod p is to multinomial delivery, p is large prime number, and j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, calculate c group (Fi (1) ..., Fi (N)) value, convert again these Godel coded numbers to pixel value that i is capable, obtain the pixel that i is capable, and obtain N the picture element matrix (P that r * c is capable ₁, P ₂..., P _n); Wherein, system (0, P) the random T-1 number (a that produces in scope ₁, a ₂..., a _t-1), for creating multinomial, provide coefficient, the modulus that P is large prime number;

Step 1.4.2: according to flag structure mark multinomial j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, distributes to t using the H calculating (t) and opens subgraph and identify as additional identification, the value of t be (1,2 ..., N); The additional identification sign that the result of calculating is each subgraph.

N in described step 1.2 and the value of T are respectively N=5, T=3.

A picture-storage system based on cloudy end, is characterized in that, comprises that picture storage module and picture recover module;

Picture storage module comprises:

The first extraction module: for extracting the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C;

Parametric configuration module: for original image being converted to N subgraph, and constructing variable T, wherein, and the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N;

Coding module: for the capable Godel coding that carries out of i of the picture element matrix B to after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer;

Polynomial construction module: for constructing multinomial according to Gi and flag, the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Distribution module: be used to every subgraph to add secondary mark,, then the good subgraph of mark is assigned at random uniformly among a plurality of high in the clouds;

Picture recovers module and comprises:

Select module: for selecting subgraph from a plurality of high in the clouds,

Authentication module: the subgraph of selecting is carried out to secondary mark checking, if subpicture tag is verified, retains current subgraph and enter judge module, otherwise, return to selection module after giving up this subgraph;

Judge module: judge whether subgraph quantity reaches T; Be to enter the second extraction module, otherwise return to selection module;

The second extraction module: the picture element matrix (P that opens subgraph for extracting T ₁, P ₂..., P _t), T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, and t represents that t opens subgraph, and t is between 1 to T, so S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into.

Recover module: for the Sit obtaining according to extraction module, utilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

Matching module: open the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtain polynomial constant term, utilize Lagrange's interpolation obtain flag ‵ to be matched;

Comparison module: for flag ‵ value to be matched and former figure flag value are compared, if flag ‵ and flag not etc. time, return to selection module; If flag ‵=flag determines B ‵=B, enter computing module;

Computing module: for B ‵ is disturbed to reduction; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC C ^-1, obtain original image.

The invention has the beneficial effects as follows:

First; a kind of picture-storage method based on cloudy end is the picture safe storage scheme based on cloudy end; mainly by utilizing deposit thought dividing of picture, solved the safety problem that picture is stored beyond the clouds; prevented that high in the clouds picture privacy from being revealed and picture has been operated to the situation that picture causes single point failure of deleting accidentally; by a former figure is divided and deposits a plurality of high in the clouds, successfully protected the safety of picture.

Secondly, this method is the picture safe storage scheme based on cloudy end, has utilized elementary transformation and Godel coding to solve the inefficiency problem in picture processing, takes full advantage of the computing capability in high in the clouds, by simple conversion, solves challenge.Thereby the efficiency of scheme is improved greatly.

Accompanying drawing explanation

Fig. 1 is the schematic flow sheet of picture-storage step;

Fig. 2 is the schematic flow sheet of picture recovering step;

Fig. 3 is schematic flow sheet of the present invention.

Embodiment

Below in conjunction with the accompanying drawing of this programme, this programme implementation process is known to complete description, obviously, described embodiment is Center for architecture process.Embodiment based in this programme, those skilled in the art are not making under the prerequisite of innovative labor, and all implementation steps are the protection range of this programme.

A picture-storage method based on cloudy end, is characterized in that, comprises the steps:

Step 1: picture-storage step;

Step 1.1. extracts the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C.

User logs in high in the clouds by networked devices such as mobile device or pc ends, and selects the picture P that will preserve ₁, the picture element matrix A of extraction picture, system produces unique sign flag, using flag as additional information, adds in matrix A, and flag value can be random integers, obtains (A, flag), and system generates an elementary transformation Matrix C and inverse matrix C ^-1, the scale of elementary matrix and picture element matrix equal and opposite in direction.Original pixels matrix A is carried out to elementary transformation and obtain B, be about to A premultiplication C and carry out line translation, then the right side is taken advantage of C to carry out rank transformation and is obtained disturbing rear matrix (B, flag).In the present embodiment, model demonstration is 3 * 3 matrixes for establishing matrix A $\left[\begin{array}{ccc}7& 8& 9\\ 4& 5& 6\\ 1& 2& 3\end{array}\right],$ System generation random number 1 is flag=1 as the value of flag, and elementary transformation Matrix C is 3 * 3 matrixes $\left[\begin{array}{ccc}0& 1& 0\\ 0& 0& 1\\ 1& 0& 0\end{array}\right],$ Inverse matrix C-1 is $\left[\begin{array}{ccc}0& 0& 1\\ 1& 0& 0\\ 0& 1& 0\end{array}\right]$ Start data and be ( $\left[\begin{array}{ccc}7& 8& 9\\ 4& 5& 6\\ 1& 2& 3\end{array}\right],$ 1), B=C * A * C after conversion. $B=\left[\begin{array}{ccc}0& 1& 0\\ 0& 0& 1\\ 1& 0& 0\end{array}\right]\×\left[\begin{array}{ccc}7& 8& 9\\ 4& 5& 6\\ 1& 2& 3\end{array}\right]\×\left[\begin{array}{ccc}0& 1& 0\\ 0& 0& 1\\ 1& 0& 0\end{array}\right],$ Through arriving of calculating $B=\left[\begin{array}{ccc}6& 4& 1\\ 3& 1& 2\\ 9& 7& 8\end{array}\right]$ Can find out that interference effect is obvious, after this step, obtain data for (B, 1).

Step 1.2. converts original image to N subgraph, and constructing variable T, wherein, the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N.After step 1.1 finishes, scheme provides two data N, T.N, T is positive number and T<=N, and N represents that original image will convert the number of subgraph to, the minimum subgraph number that T representative can extensive restored map.Be respectively N=5, T=3, for subsequent step provides system parameters;

I capable the carry out Godel coding of step 1.3. to the picture element matrix B after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer.In the present embodiment, to disturbing rear picture element matrix $B=\left[\begin{array}{ccc}6& 4& 1\\ 3& 1& 2\\ 9& 7& 8\end{array}\right]$ Carry out Godel conversion, B is by 1 generation.The first row G ₁=2 ⁶* 3 ⁴* 5 ¹=64 * 81 * 5=25920.G ₂=2 ³* 3 ¹* 5 ²=600, G ₃=2 ⁹* 3 ⁷* 5 ⁸=512 * 27 * 390625=5400000000,

Step 1.4. is according to Gi and flag structure multinomial, and the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Step 1.4.1: according to Gi structure conversion multinomial, wherein: mod P is to multinomial delivery, P is large prime number, and j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, calculate c group (Fi (1) ..., Fi (N)) value, convert again these Godel coded numbers to pixel value that i is capable, obtain the pixel that i is capable, and obtain N the picture element matrix (P that r * c is capable ₁, P ₂..., P _n); Wherein, system (0, P) the random T-1 number (a that produces in scope ₁, a ₂..., a _t-1), for creating multinomial, provide coefficient, the modulus that P is large prime number;

In the present embodiment, system produces T-1=3-1=2 random number (a ₁, a ₂), be divided into a ₁=1, a ₂=2. item can to construct three multinomials be F ₁(x)=G ₁+ x+2x ², F ₂(x)=G ₂+ x+2x ², F ₃(x)=G ₃+ x+2x ², x is expressed as equation variable, calculate (Fi (1) Fi (2) ..., Fi (5)) and obtain three groups of data (F ₁(1)=25923, F ₁(2)=25930, F ₁(3)=25941, F ₁(4)=25956, F ₁(5)=25975), (F ₁(1)=603, F ₂(2)=610, F ₂(3)=618, F ₂(4)=636, F ₂(5)=655), (F ₃(1)=5400000003, F ₃(2)=5400000010, F ₃(3)=5400000018, F ₃(4)=5400000036, F ₃(5)=5400000055), according to fundamental theorem of arithmetic, the unique decomposition theorem that is called again positive integer, each is greater than 1 natural number all can be written as the long-pending of prime number, and after these prime factors arrange by size, literary style only has a kind of mode, therefore each the Godel coded number calculating can convert one group of new number to, a line using this group number of conversion as subimage prime matrix, therefore realizes these conversion imaging prime matrix forms is obtained to five picture element matrixs, is respectively P ₁, P ₂, P ₃, P ₄, P ₅.As P ₁, it by $\left[\begin{array}{c}{F}_1\left(1\right)\\ F_2\left(1\right)\\ F_3\left(1\right)\end{array}\right]$ ? $\left[\begin{array}{c}25923\\ 603\\ 5400000003\end{array}\right],$ It is carried out to prime factorization, and conversion imaging prime matrix is $\left[\begin{array}{ccc}3& 8641& 0\\ 3& 3& 67\\ 2^2\&times;3& 17& 257\end{array}\right].$ Other the like, every number is decomposed.

Step 1.4.2: according to flag structure mark multinomial j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, distributes to t using the H calculating (t) and opens subgraph and identify as additional identification, the value of t be (1,2 ..., N); The additional identification sign that the result of calculating is each subgraph.

In the present embodiment, flag=1, random number (a ₁, a ₂) structure H (x)=1+x+2x ².Calculate (H (1)=4, H (2)=11, H (3)=19, H (4)=37, H (5)=56), through above not process can obtain five with the similar structure (P of former figure ₁, 4) and (P ₂, 11) and (P ₃, 19) and (P ₄, 37) and (P ₅, 56).

Step 1.5. is that every subgraph adds mark, as digital signature etc., after the good subgraph of mark is assigned among a plurality of high in the clouds at random uniformly.For every subgraph adds mark, then the good subgraph of mark is assigned among a plurality of high in the clouds at random uniformly, avoid single high in the clouds storing excess subgraph.After mark, subgraph 1, subgraph 2, subgraph 3, subgraph 4, subgraph 5.Be stored in three high in the clouds, subgraph 1 and subgraph 2 are preserved in high in the clouds 1, and subgraph 3 is preserved in high in the clouds 2, subgraph 4, and subgraph 5. is preserved in high in the clouds 3

Be picture recovering step below:

Step 2.1. selects subgraph from a plurality of high in the clouds.Due in the present embodiment, T=3, so only need find 3 subgraphs to recover.

Step 2.2. carries out secondary mark checking to the subgraph of selecting, if subpicture tag is verified, retains current subgraph and enters step 2.3, otherwise, return to step 2.1 after giving up this subgraph;

Mark proof procedure, chooser Fig. 3 in 2 beyond the clouds, the mark of checking subgraph 3, retains subgraph 3 by checking, and current reservation subgraph number is 1, owing to being less than T, continues checking subgraph.From high in the clouds 2, select destroyed subgraph 1 ', checking subgraph, authentication failed, gives up.

Step 2.3. judges whether subgraph quantity reaches T; Be to enter step 2.4, otherwise return to step 2.1;

In the present embodiment, chooser Fig. 4 from high in the clouds 2, verification mark, retains subgraph 4 by checking, chooser Fig. 5 from high in the clouds 3, verification mark, retains subgraph 5 by checking, and current reservation subgraph number is 3 to equal T.

Step 2.4. extracts the picture element matrix that T opens subgraph, T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, and t represents that t opens subgraph, and t is between 1 to T, so S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into.

In the present embodiment, through step 2.3, obtain the picture element matrix P of subgraph 3 ₃, the picture element matrix P of subgraph 4 ₄, obtain subgraph 5 picture element matrix P ₅, and, the additional information H of three subgraphs (3), H (4), H (5), is (P ₃, 19), (P ₄, 37), (P ₅, 56).By subimage prime matrix P ₃, P ₄and P ₅every a line convert Godel coded number to, because three matrixes are 3*3 square formation, so obtain three groups of group data, data one are ((3,25941), (3,618), (3,5400000018)), data two are ((4,25956), (4,636), (4,5400000036)), data three are ((5,25975), (5,655), (5,5400000055)).

The S that step 2.5. obtains according to step 2.4 _i ^tutilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

In the present embodiment, the data that obtained by step 2.4, according to three points in the known known quadratic polynomial of Lagrange's interpolation, can obtain quadratic polynomial, because obtain three function F 1 (x) in step 3, F2 (x), F3 (x) according to three groups of data, then make x equal 0, obtain constant term.While asking three functions, the Lagrange's interpolation formula of application is calculate F1 (0)=25920, F2 (0)=600, F3 (0)=5400000000, then converts the Godel coded number obtaining to matrix the first behavior (6,4,1) the second behavior (3,1,2), the third line is that (9,8,7) can obtain picture element matrix $B=\left[\begin{array}{ccc}6& 4& 1\\ 3& 1& 2\\ 9& 7& 8\end{array}\right].$

Step 2.6. opens the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtains polynomial constant term, utilizes Lagrange's interpolation obtain flag ‵ to be matched.

In the present embodiment, extract the additional identification (P of three subgraphs ₃, 19), (P ₄, 37), (P ₅, 56), utilize this three data, according to Lagrangian difference, calculate flag to be matched ‵=1.

Step 2.7. compares flag ‵ value to be matched and former figure flag value, if flag ‵ and flag not etc. time, return to step 2.1; If flag ‵=flag determines B ‵=B, enter step 2.8;

In the present embodiment, flag to be matched ‵=1 equates with the flag preserving, and proves and recovers correct, if flag ‵ to be matched is not equal to flag, from new recovery.

Step 2.8. disturbs reduction by B ‵; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC C ^-1, obtain original image.By the flag calculating, compare with the flag retaining in step 1, if flag, it is correct that=flag represents to recover, by the picture element matrix recovering $B=\left[\begin{array}{ccc}6& 4& 1\\ 3& 1& 2\\ 9& 7& 8\end{array}\right]$ Carry out inverse transformation and obtain the picture element matrix A of former picture, system provides the inverse matrix of the elementary transformation of reservation $C^{-1}\left[\begin{array}{ccc}0& 0& 1\\ 1& 0& 0\\ 0& 1& 0\end{array}\right]\text{,}$ A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC $C^{-1}=\left[\begin{array}{ccc}7& 8& 9\\ 4& 5& 6\\ 1& 2& 3\end{array}\right].$ So far obtain the picture element matrix of former figure, former figure has recovered.

A picture-storage system based on cloudy end, is characterized in that, comprises that picture storage module and picture recover module;

Picture storage module comprises:

The first extraction module: for extracting the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C;

Parametric configuration module: for original image being converted to N subgraph, and constructing variable T, wherein, and the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N;

Coding module: for the capable Godel coding that carries out of i of the picture element matrix B to after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer;

Polynomial construction module: for constructing multinomial according to Gi and flag, the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Distribution module: be used to every subgraph to add secondary mark,, then the good subgraph of mark is assigned at random uniformly among a plurality of high in the clouds;

Picture recovers module and comprises:

Select module: for selecting subgraph from a plurality of high in the clouds,

Authentication module: the subgraph of selecting is carried out to secondary mark checking, if subpicture tag is verified, retains current subgraph and enter judge module, otherwise, return to selection module after giving up this subgraph;

Judge module: judge whether subgraph quantity reaches T; Be to enter the second extraction module, otherwise return to selection module;

The second extraction module: the picture element matrix (P that opens subgraph for extracting T ₁, P ₂..., P _t), T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, and t represents that t opens subgraph, and t is between 1 to T, so S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into.

Recover module: for the Sit obtaining according to extraction module, utilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

Matching module: open the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtain polynomial constant term, utilize Lagrange's interpolation obtain flag ‵ to be matched;

Comparison module: for flag ‵ value to be matched and former figure flag value are compared, if flag ‵ and flag not etc. time, return to selection module; If flag ‵=flag determines B ‵=B, enter computing module;

Computing module: for B ‵ is disturbed to reduction; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC C ^-1, obtain original image.

Claims (4)

1. the picture-storage method based on cloudy end, is characterized in that, comprises the steps:

Step 1: picture-storage step;

Step 1.1: extract the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C;

Step 1.2: convert original image to N subgraph, and constructing variable T, wherein, and the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N;

Step 1.3: to the capable Godel coding that carries out of i of the picture element matrix B after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer;

Step 1.4: according to Gi and flag structure multinomial, the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Step 1.5: for every subgraph adds secondary mark,, then the good subgraph of mark is assigned at random uniformly among a plurality of high in the clouds;

Step 2: picture recovering step:

Step 2.1: select subgraph from a plurality of high in the clouds;

Step 2.2: the subgraph of selecting is carried out to secondary mark checking, if subpicture tag is verified, retains current subgraph and enter step 2.3, otherwise, return to step 2.1 after giving up this subgraph;

Step 2.3: judge whether subgraph quantity reaches T; Be to enter step 2.4, otherwise return to step 2.1;

Step 2.4: extract the picture element matrix (P that T opens subgraph ₁, P ₂..., P _t), T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, t represents that t opens subgraph, t between 1 to T, S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into;

Step 2.5: the S obtaining according to step 2.4 _i ^tutilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

Step 2.6: open the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtain polynomial constant term, utilize Lagrange's interpolation obtain flag ‵ to be matched;

Step 2.7: flag ‵ value to be matched and former figure flag value are compared, if flag ‵ and flag not etc. time, return to step 2.1; If flag ‵=flag determines B ‵=B, enter step 2.8;

Step 2.8: B ‵ is disturbed to reduction; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1b C ^-1=C ^-1cAC C ^-1, obtain original image.

2. a kind of picture-storage method based on cloudy end according to claim 1, is characterized in that, described step 1.4 comprises the steps:

Step 1.4.1: according to Gi structure conversion multinomial, wherein: mod p is to multinomial delivery, p is large prime number, and j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, calculate c group (Fi (1) ..., Fi (N)) value, convert again these Godel coded numbers to pixel value that i is capable, obtain the pixel that i is capable, and obtain N the picture element matrix (P that r * c is capable ₁, P ₂..., P _n); Wherein, system (0, P) the random T-1 number (a that produces in scope ₁, a ₂..., a _t-1), for creating multinomial, provide coefficient, the modulus that P is large prime number;

Step 1.4.2: according to flag structure mark multinomial j is a value from 1 to T-1 variable, a _jrepresent (a ₁, a ₂..., a _t-1), x ^jj the power that represents x, distributes to t using the H calculating (t) and opens subgraph and identify as additional identification, the value of t be (1,2 ..., N); The additional identification sign that the result of calculating is each subgraph.

3. a kind of picture-storage method based on cloudy end according to claim 1 and 2, is characterized in that: the N in described step 1.2 and the value of T are respectively N=5, T=3.

4. the picture-storage system based on cloudy end, is characterized in that, comprises that picture storage module and picture recover module;

Picture storage module comprises:

The first extraction module: for extracting the picture element matrix A of former figure, for picture element matrix adds unique identification flag, and the flag value of preserving picture; Calculate the picture element matrix B after disturbing, B=C * A * C, system is preserved C ^-1, wherein, Matrix C is the elementary transformation matrix of picture element matrix A formed objects, C ^-1inverse matrix for Matrix C;

Parametric configuration module: for original image being converted to N subgraph, and constructing variable T, wherein, and the minimum subgraph number that T representative can extensive restored map, N and T are positive number and T≤N;

Coding module: for the capable Godel coding that carries out of i of the picture element matrix B to after disturbing, the Godel coded number of changing out is Gi, every a line of traversal picture element matrix; Wherein: if picture picture element matrix size is r * c, the value of i be (1,2,3 ..., c), i, r and c are positive integer;

Polynomial construction module: for constructing multinomial according to Gi and flag, the multinomial of Gi structure obtains the picture element matrix (P that N opens subgraph ₁, P ₂..., P _n), according to the picture element matrix (P producing ₁, P ₂..., P _n) formation subgraph; Meanwhile, the multinomial of flag structure obtains additional identification sign, for subgraph adds additional identification identification information;

Distribution module: be used to every subgraph to add secondary mark,, then the good subgraph of mark is assigned at random uniformly among a plurality of high in the clouds;

Picture recovers module and comprises:

Select module: for selecting subgraph from a plurality of high in the clouds,

Authentication module: the subgraph of selecting is carried out to secondary mark checking, if subpicture tag is verified, retains current subgraph and enter judge module, otherwise, return to selection module after giving up this subgraph;

Judge module: judge whether subgraph quantity reaches T; Be to enter the second extraction module, otherwise return to selection module;

The second extraction module: the picture element matrix (P that opens subgraph for extracting T ₁, P ₂..., P _t), T is opened to the capable Godel coded number S that converts to of i of picture element matrix _i ^t, wherein i represents that the i of picture element matrix is capable, and t represents that t opens subgraph, and t is between 1 to T, so S _i ^tbe expressed as the Godel coded number that the capable pixel of i that t opens the picture element matrix of subgraph changes into;

Recover module: for the S obtaining according to extraction module _i ^tutilize Lagrange's interpolation simultaneously wherein: t is integer, represent t pictures, j is integer, represents to obtain j pictures in subgraph, and mod p is delivery p, and p is a large prime number; Godel coded number Gi ‵ to recovering to disturb picture element matrix B ‵, carries out Godel code conversion by the Gi ‵ obtaining and obtains the capable pixel of picture element matrix i, by T being opened to each row of subgraph, carries out above-mentioned computing, obtains complete recovery and disturbs picture element matrix B ‵;

Matching module: open the additional identification sign H (t) of subgraph according to t, obtain T (t, H (t)) coordinate points, obtain polynomial constant term, utilize Lagrange's interpolation obtain flag ‵ to be matched;

Comparison module: for flag ‵ value to be matched and former figure flag value are compared, if flag ‵ and flag not etc. time, return to selection module; If flag ‵=flag determines B ‵=B, enter computing module;

Computing module: for B ‵ is disturbed to reduction; Utilize C ^-1recover original image prime matrix A, wherein, C ^-1for the inverse matrix of the elementary transformation Matrix C of picture element matrix A, finally calculate A=C ^-1b ‵ C ^-1=C ^-1bC ^-1=C ^-1cAC C ^-1, obtain original image.