CN107070638B - Ocean remote sensing image secret sharing method of dynamic weighting threshold - Google Patents

Ocean remote sensing image secret sharing method of dynamic weighting threshold Download PDF

Info

Publication number
CN107070638B
CN107070638B CN201710259920.9A CN201710259920A CN107070638B CN 107070638 B CN107070638 B CN 107070638B CN 201710259920 A CN201710259920 A CN 201710259920A CN 107070638 B CN107070638 B CN 107070638B
Authority
CN
China
Prior art keywords
image
secret
sequence
sub
calculating
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710259920.9A
Other languages
Chinese (zh)
Other versions
CN107070638A (en
Inventor
黄冬梅
史景聪
杨海鑫
徐慧芳
杜艳玲
贺琪
郑小罗
苏诚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Ocean University
Original Assignee
Shanghai Ocean University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Ocean University filed Critical Shanghai Ocean University
Priority to CN201710259920.9A priority Critical patent/CN107070638B/en
Publication of CN107070638A publication Critical patent/CN107070638A/en
Application granted granted Critical
Publication of CN107070638B publication Critical patent/CN107070638B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Power Engineering (AREA)
  • Image Processing (AREA)

Abstract

The invention relates to a marine remote sensing image secret sharing method of a dynamic weighting threshold, which is characterized by comprising an initialization stage module, an image characteristic hash value generation module, a shadow information distribution module and a secret image recovery module. The method has the advantages that dynamic change of the participants is supported, the sub-secrets do not need to be redistributed, and implementation cost is reduced; each sub-secret is stored by the participant, when the image is restored, the sub-secret held by each participant is not required to be disclosed, the image can be restored only by providing the shadow information of the sub-secret, and the reusability of the sub-secret is ensured; introducing bulletin board release auxiliary information; based on the Chinese remainder theorem, the secret sharing of the weighted participants is realized, and the shared sub-secret is converted into polynomial linear combination, so that the method can dynamically add or update the secret and has flexibility.

Description

Ocean remote sensing image secret sharing method of dynamic weighting threshold
Technical Field
The invention relates to the technical field of information security, in particular to a method for secretly sharing marine remote sensing images by using a dynamic weighting threshold.
Background
In the existing threshold multi-secret sharing scheme, the problems that secret shares of participants are generated by secret distributors, members are added or deleted and the like exist, a system needs to distribute the secret shares to all the participants again and the like, and the flexibility is poor when the dynamic change of a participant set is processed. Existing solutions can solve the problem of new member joining, but face difficulties in dealing with wakefulness of old members leaving. If a company allocates a sub-secret to each employee for sharing the secret in each project group in which the employee participates, and a certain employee withdraws from a project halfway or quits from the company, the company faces the problem of confidentiality, but the work load of replacing the sub-secrets of all related employees is large, and the operability is poor.
A dynamic secret sharing scheme has emerged to improve the communication efficiency of the sharing scheme, reduce the key management cost and handle the flexibility of secrets, participants when dynamically changing. A (k, n) multi-secret sharing scheme capable of dynamically adjusting a threshold value, for different shared secrets, a secret distributor can dynamically adjust the threshold value for recovering the secret according to the importance of the secret, and can efficiently add or delete members without changing the secret shares of other members, thereby having higher safety and practicability. In addition, there is also an identity-based weighted dynamic secret sharing scheme. When reconstruction fails, the cheating behavior of the participant is discovered by verifying the identity of the participant, however, the scheme only shares one secret at a time, and the algorithm needs to be executed again when the secret is updated.
The Chinese patent CN201510416888.1, published as 2015.11.18, discloses a group authentication method based on threshold secret sharing, which comprises marking n group members as { U }i-i ═ 1,2, …, n }; generating and distributing two secret shares(s) for each group member Ui by a secret distributor using a (t, n) threshold secret sharing scheme1i，s2i) (ii) a And generates and distributes 2 x (t-1) secret shares(s) for the group authentication server AS1i，s2i) I ═ n +1, … …, n + t-1; when authentication is performed, if m users need to be authenticated, each authenticated user UiBy using own secretSecret fraction s1i，s2iGenerating 2 tokens; the group authentication server can perform consent authentication and one-by-one authentication on m users to be authenticated. By the method, whether all users are legal or not can be verified at one time, and all non-group members can be quickly and effectively determined under the condition that the non-group members exist. However, the method cannot solve the problem that all the sub-secrets need to be reconstructed due to dynamic change of the members, and is poor in flexibility.
Chinese patent CN201510704890.9, published as 2016.03.16, discloses a (k, n) threshold-based user-optimized visual secret sharing method, which includes that a binary secret image S performs (k, n) random grid processing to obtain n basic shared images of random grids; the input gray cover image is processed by histogram equalization to block the image, the cover image after blocking with the gray level equivalent to each small gray level of the image is obtained, then the halftone processing is carried out, and the shared cover image after halftone is obtained according to the generated dither matrix; the resulting base share and cover images are processed in blocks and combined in a fixed-value delta stacking ratio with subdivision blocks to generate a meaningful final share image. By the method, attacks of attackers can be placed, a meaningful final shared image is generated, and the application range of visual secret sharing is expanded. However, this method cannot improve the communication efficiency of the sharing scheme, reduce the key management cost, and handle the flexibility when the secret and the participant change dynamically.
Therefore, there is a need for a secret sharing method that improves the communication efficiency of the sharing scheme, reduces the key management cost and processes the secret, improves the flexibility of participants when dynamically changing, and distributes sub-secrets according to weights, and no report on such a method is found at present.
Disclosure of Invention
The invention aims to provide a method for secretly sharing marine remote sensing images by dynamic weighting threshold aiming at the defects in the prior art.
In order to achieve the purpose, the invention adopts the technical scheme that:
a marine remote sensing image secret sharing method of a dynamic weighting threshold comprises an initialization stage module, an image characteristic hash value generation module, a shadow information distribution module and a secret image recovery module, and the working process of the method is as follows:
s1: initialization phase module
The secret distributor constructs a secret image Mignotte sequence of the marine remote sensing image according to weight distribution on the basis of the Mignotte sequence, and the secret image Mignotte sequence is marked as an O-Mignotte sequence;
s2: image characteristic hash value generation module
Blocking the sensitive area image of the remote sensing image, calculating the gray average value of each image block to obtain a gray average value sequence as the intermediate hash value of the image, and calculating the average value of the gray average value sequence
Figure GDA0002446247370000021
The image intermediate hash value is compared with
Figure GDA0002446247370000022
Are compared one by one and are greater than
Figure GDA0002446247370000023
Code is 1, less than
Figure GDA0002446247370000024
The code is marked as 0, and the hash value of the image is finally obtained by connecting the code values in series;
s3: shadow information distribution module
On the basis of an O-Mignotte sequence, partitioning the remote sensing image, calculating hash values of all partitioned images, calculating the size of a secret segment of the marine remote sensing image according to the number of bits of the secret segment, decomposing the secret image into secret shares with different weights, and calculating shadow information of the secret shares by a secret distributor and issuing the shadow information to participants;
s4: secret image recovery module
Based on the Chinese remainder theorem, the secret image is recovered by using the sub-secret provided by the participants and the notice information on the bulletin board.
As a preferred technical solution, the step of constructing the O-Mignotte of the initialization stage module is:
s11: setting the weight threshold of the access structure as w, then the requirement is satisfied
Figure GDA0002446247370000031
S12: construction integer d'1,d'2,...,d'nThe sequence is reciprocal;
s13: according to the participant weight sequence ω ═ ω (ω ═ ω)1,ω2,…,ωn) D 'is'1,d'2,...,d'nThe sequence is extended to obtain d'1...d'1,d'2...d'2,...,d'n...d'nI.e. by
Figure GDA0002446247370000032
S14: the O-Mignotte sequence is published;
s15 calculation of α and β after the construction of O-Mignotte sequence is completed, wherein
Figure GDA0002446247370000033
As a preferred technical solution, the hash value calculation step of the image feature production hash value module is:
s21: extracting the multiband image into a single-waveband image;
s22: using formulas
Figure GDA0002446247370000034
Limiting the number of the image blocks, and recording as i, so that the number of the image blocks is consistent with the number of the secret segments;
s23: the image A of the sensitive area is divided into blocks, the number of the blocks is i, namely the image A is divided into1,A2,…,AiA block;
s24: separately extracting A1,A2,…,AiOf the gray value matrix of (2), each matrix being calculatedAnd is noted as M1,M2,…,Mi(ii) a The matrix mean value M of each sub-image1,M2,…,MiMerging to obtain a sequence with the length of i as an intermediate hash value; calculating the mean of the sequence
Figure GDA0002446247370000035
Is marked as Md，Md＝median(Mj) Wherein j ═ (1,2, …, i);
s25: will be provided with
Figure GDA0002446247370000036
Comparing with the intermediate hash value one by one, and recording the compared result as binary sequence to obtain hash value H, where H is
Figure GDA0002446247370000037
As a preferred technical solution, the shadow information distribution module comprises the following working steps:
s31, calculating prime number N on the basis of the O-Mignotte sequence, wherein the calculation formula is that N is αβ;
s32: calculating a prime number g with the formula of g[(α-1)(β-1)/2]≡1mod N；
S33: will { g, N, omega }iThe bulletin board is released;
s34: partitioning the secret image, extracting a gray value matrix of the secret image, and calculating a hash value sequence H of the secret image;
s35: calculating a secret image S, wherein the calculation formula is S ═ Decimal (H);
s36: computing a sub-secret share S based on participant weightsiThe calculation formula is
Figure GDA0002446247370000041
Wherein i is 1,2, …, n;
s37: calculating shadow information siThe calculation formula is
Figure GDA0002446247370000042
S38: shadow information siTo each participant UiAnd (5) storing.
As a preferred technical solution, the secret image recovery module specifically comprises the steps of:
s41: let the sum of the weights of k participants be t, and the participants be { U1,U2,…,Uk}；
S42: judging whether the number of members changes, if not, entering step S43, if so, entering step S46, and if so, entering step S411;
s43: the number of members is unchanged, and
Figure GDA0002446247370000043
participants join to access the bulletin board;
s44: each participant downloads g from the bulletin board and computes a secret share Si；
S45: based on the Chinese remainder theorem, the image is restored, and the calculation formula is
Figure GDA0002446247370000044
S46: the number of members is increased and new member U is setn+1Adding and updating the set of participants to be { U1,U2,…,Un,Un+1}，Un+1Has a weight of ωn+1；
S47: update the O-Mignotte sequence to
Figure GDA0002446247370000045
S48, recalculating the values α, β and N, g;
s49: calculating new sub-secrets according to the new member weight, and keeping the rest sub-secrets unchanged;
s410: repeating the steps S41-S45 to restore the image;
s411: the number of members is reduced, and the member U is providedjQuit, update the set of participants as { U1,…,Uj-1,Uj+1,…,Un}，Un+1Has a weight of ωj；
S412: update the O-Mignotte sequence to
Figure GDA0002446247370000046
S413, recalculating α, β and N, g values;
s414: according to the number U of the leaving memberjEliminating the sub-secret SjThe other sub-secrets remain unchanged;
s415: repeating the steps S41-S45 to restore the image.
The invention has the advantages that:
1. the dynamic change of the participants is supported, and the sub-secrets do not need to be redistributed, so that the implementation cost is reduced;
2. each sub-secret is stored by the participant, when the image is restored, the sub-secret held by each participant is not required to be disclosed, the image can be restored only by providing the shadow information of the sub-secret, and the reusability of the sub-secret is ensured;
3. introducing bulletin board release auxiliary information;
4. based on the Chinese remainder theorem, the secret sharing of the weighted participants is realized, and the shared sub-secret is converted into polynomial linear combination, so that the method can dynamically add or update the secret and has flexibility.
Drawings
FIG. 1 is a flow chart of a dynamic weighting threshold ocean remote sensing image secret sharing method.
FIG. 2 is a flow chart of an initialization module of the dynamic weighting threshold marine remote sensing image secret sharing method.
Fig. 3 is a flowchart of an image feature hash value generation module of the dynamic weighting threshold marine remote sensing image secret sharing method of the present invention.
FIG. 4 is a flow chart of a shadow information distribution module of the dynamic weighting threshold ocean remote sensing image secret sharing method.
Fig. 5 is a flowchart of a secret image recovery module of the dynamic weighting threshold marine remote sensing image secret sharing method of the invention.
Detailed Description
Example 1
The invention discloses a dynamic weighting threshold ocean remote sensing image secret sharing method, which comprises an initialization stage module, an image characteristic hash value generation module, a shadow information distribution module and a secret image recovery module, and the method comprises the following working procedures with reference to FIG. 1:
s1: initialization phase module
The secret distributor constructs a secret image Mignotte sequence of the marine remote sensing image according to weight distribution on the basis of the Mignotte sequence, and the secret image Mignotte sequence is marked as an O-Mignotte sequence;
s2: image characteristic hash value generation module
Blocking the sensitive area image of the remote sensing image, calculating the gray average value of each image block to obtain a gray average value sequence as the intermediate hash value of the image, and calculating the average value of the gray average value sequence
Figure GDA0002446247370000051
The image intermediate hash value is compared with
Figure GDA0002446247370000052
Are compared one by one and are greater than
Figure GDA0002446247370000053
Code is 1, less than
Figure GDA0002446247370000054
The code is marked as 0, and the hash value of the image is finally obtained by connecting the code values in series;
s3: shadow information distribution module
On the basis of an O-Mignotte sequence, partitioning the remote sensing image, calculating hash values of all partitioned images, calculating the size of a secret segment of the marine remote sensing image according to the number of bits of the secret segment, decomposing the secret image into secret shares with different weights, and calculating shadow information of the secret shares by a secret distributor and issuing the shadow information to participants;
s4: secret image recovery module
Based on the Chinese remainder theorem, the secret image is recovered by using the sub-secret provided by the participants and the notice information on the bulletin board.
Example 2
The preferred method for secretly sharing the marine remote sensing image with the dynamic weighting threshold is as follows.
S1: initialization phase module
Let the number of participants be n, the total set of participants be {1,2, …, n }, the set of all subsets of the total set of participants be P, and the weight sequence of each participant be ω, ω ═ ω (ω ═ ω { (ω) } for each participant1,ω2,…,ωn) The weight threshold of the access structure is w, the secret distributor constructs an extended O-Mignotte sequence based on the Mignotte sequence according to weight distribution, so that the extended O-Mignotte sequence has equivalent effect to the traditional Mignotte sequence, and referring to FIG. 2, the specific steps of constructing the O-Mignotte sequence are as follows:
s11: setting the weight threshold of the access structure as w, then the requirement is satisfied
Figure GDA0002446247370000061
S12: construction integer d'1,d'2,...,d'nThe sequence is reciprocal;
s13: according to the participant weight sequence ω ═ ω (ω ═ ω)1,ω2,…,ωn) D 'is'1,d'2,...,d'nThe sequence is extended to obtain d'1...d'1,d'2...d'2,...,d'n...d'nI.e. by
Figure GDA0002446247370000062
S14: the O-Mignotte sequence is published;
S15O-Mignotte sequence construction is completed, α and β are calculated, and S is more than βi< α, wherein
Figure GDA0002446247370000063
S2: image characteristic hash value generation module
Extracting the ocean remote sensing image to obtain a single-band image, partitioning the single-band image, calculating a gray average value of each image block to obtain a gray average value sequence serving as an image intermediate hash value, and calculating an average value of the gray average value sequence
Figure GDA0002446247370000064
The image intermediate hash value is compared with
Figure GDA0002446247370000065
Are compared one by one and are greater than
Figure GDA0002446247370000066
Code is 1, less than
Figure GDA0002446247370000067
The code is 0, and the hash value of the image is finally obtained by concatenating the code values, referring to fig. 3, the specific steps are as follows:
s21: extracting the multiband image into a single-waveband image;
s22: using formulas
Figure GDA0002446247370000071
Limiting the number of the image blocks, and recording as i, so that the number of the image blocks is consistent with the number of the secret segments;
s23: the image A of the sensitive area is divided into blocks, the number of the blocks is i, namely the image A is divided into1,A2,…,AiA block;
s24: separately extracting A1,A2,…,AiThe mean value of each matrix is calculated and recorded as M1,M2,…,Mi(ii) a The matrix mean value M of each sub-image1,M2,…,MiMerging to obtain a sequence with the length of i as an intermediate hash value; calculating the mean of the sequence
Figure GDA0002446247370000072
Is marked as Md，Md＝median(Mj) Wherein j ═ (1,2, …, i);
s25: will be provided with
Figure GDA0002446247370000073
Comparing with the intermediate hash value one by one, and recording the compared result as binary sequence to obtain hash value H, where H is
Figure GDA0002446247370000074
S3: shadow information distribution module
On the basis of an O-Mignotte sequence, partitioning a remote sensing image, calculating hash values of all partitioned images, calculating the size of a secret segment of a marine remote sensing image according to the number of bits of the secret segment, decomposing the secret image into secret shares with different weights, obtaining the secret image by a secret manager, calculating the remaining number of the secret image as a sub-secret, and calculating shadow information of the sub-secret by a secret distributor and issuing the shadow information to participants, wherein the method comprises the following specific steps of:
s31, calculating prime number N on the basis of the O-Mignotte sequence, wherein the calculation formula is that N is αβ;
s32: calculating a prime number g with the formula of g[(α-1)(β-1)/2]≡1mod N；
S33: will { g, N, omega }iThe bulletin board is released;
s34: partitioning the secret image, extracting a gray value matrix of the secret image, and calculating a hash value sequence H of the secret image;
s35: calculating a secret image S, wherein the calculation formula is S ═ Decimal (H);
s36: computing a sub-secret share S based on participant weightsiThe calculation formula is
Figure GDA0002446247370000075
Wherein i is 1,2, …, n;
s37: calculating shadow information siThe calculation formula is
Figure GDA0002446247370000076
S38: shadow information siTo each participant UiAnd (5) storing.
S4: secret image recovery module
On the basis of the Chinese remainder theorem, the secret image is restored by using the subconcrement provided by the participants and the notice information on the notice board, and the method comprises the following specific steps of:
s41: let the sum of the weights of k participants be t, and the participants be { U1,U2,…,Uk}；
S42: judging whether the number of members changes, if not, entering step S43, if so, entering step S46, and if so, entering step S411;
s43: the number of members is unchanged, and
Figure GDA0002446247370000081
participants join to access the bulletin board;
s44: each participant downloads g from the bulletin board and computes a secret share Si；
S45: based on the Chinese remainder theorem, the image is restored, and the calculation formula is
Figure GDA0002446247370000082
S46: the number of members is increased and new member U is setn+1Adding and updating the set of participants to be { U1,U2,…,Un,Un+1}，Un+1Has a weight of ωn+1；
S47: update the O-Mignotte sequence to
Figure GDA0002446247370000083
S48, recalculating the values α, β and N, g;
s49: calculating new sub-secrets according to the new member weight, and keeping the rest sub-secrets unchanged;
s410: repeating the steps S41-S45 to restore the image;
s411: the number of members is reduced, and the member U is providedjQuit, update the set of participants as { U1,…,Uj-1,Uj+1,…,Un}，Un+1Has a weight of ωj；
S412: update the O-Mignotte sequence to
Figure GDA0002446247370000084
S413, recalculating α, β and N, g values;
s414: according to the number U of the leaving memberjEliminating the sub-secret SjThe other sub-secrets remain unchanged;
s415: repeating the steps S41-S45 to restore the image.
The marine remote sensing image secret sharing method based on the dynamic weighting threshold has the advantages that dynamic change of participants is supported, sub-secrets do not need to be redistributed, and implementation cost is reduced; each sub-secret is stored by the participant, when the image is restored, the sub-secret held by each participant is not required to be disclosed, the image can be restored only by providing the shadow information of the sub-secret, and the reusability of the sub-secret is ensured; introducing bulletin board release auxiliary information; based on the Chinese remainder theorem, the secret sharing of the weighted participants is realized, and the shared sub-secret is converted into polynomial linear combination, so that the method can dynamically add or update the secret and has flexibility.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and additions can be made without departing from the method of the present invention, and these modifications and additions should also be regarded as the protection scope of the present invention.

Claims (5)

1. The method for sharing the marine remote sensing image secret of the dynamic weighting threshold is characterized by comprising an initialization stage module, an image feature hash value generation module, a shadow information distribution module and a secret image recovery module, and the working process is as follows:
s1: initialization phase module
The secret distributor constructs a secret image Mignotte sequence of the marine remote sensing image according to weight distribution on the basis of the Mignotte sequence, and the secret image Mignotte sequence is marked as an O-Mignotte sequence;
s2: image characteristic hash value generation module
Blocking the sensitive area image of the remote sensing image, calculating the gray average value of each image block to obtain a gray average value sequence as the intermediate hash value of the image, and calculating the average value of the gray average value sequence
Figure FDA0002446247360000011
The image intermediate hash value is compared with
Figure FDA0002446247360000012
Are compared one by one and are greater than
Figure FDA0002446247360000013
Code is 1, less than
Figure FDA0002446247360000014
The code is marked as 0, and the hash value of the image is finally obtained by connecting the code values in series;
s3: shadow information distribution module
On the basis of an O-Mignotte sequence, partitioning the remote sensing image, calculating hash values of all partitioned images, calculating the size of a secret segment of the marine remote sensing image according to the number of bits of the secret segment, decomposing the secret image into secret shares with different weights, and calculating shadow information of the secret shares by a secret distributor and issuing the shadow information to participants;
s4: secret image recovery module
Based on the Chinese remainder theorem, the secret image is recovered by using the sub-secret provided by the participants and the notice information on the bulletin board.
2. The method for secretly sharing marine remote sensing images with the dynamic weighting threshold according to claim 1, wherein the step of constructing the O-Mignotte by the initialization stage module comprises the following steps:
s11: setting the weight threshold of the access structure as w, then the requirement is satisfied
Figure FDA0002446247360000015
S12: construction integer d'1,d’2,...,d’nThe sequence is reciprocal;
s13: according to the participant weight sequence ω ═ ω (ω ═ ω)1,ω2,…,ωn) D 'is'1,d′2,...,d′nThe sequence is extended to obtain d'1...d′1,d′2...d′2,...,d′n...d′nI.e. by
Figure FDA0002446247360000016
S14: the O-Mignotte sequence is published;
s15 calculation of α and β after the construction of O-Mignotte sequence is completed, wherein
Figure FDA0002446247360000017
3. The marine remote sensing image secret sharing method of the dynamic weighting threshold according to claim 2, wherein the image feature production hash value module comprises the following hash value calculation steps:
aS 21: extracting the multiband image into a single-waveband image;
s22: using formulas
Figure FDA0002446247360000021
Limiting the number of the image blocks, and recording as i, so that the number of the image blocks is consistent with the number of the secret segments;
s23: the image A of the sensitive area is divided into blocks, the number of the blocks is i, namely the image A is divided into1,A2,…,AiA block;
s24: separately extracting A1,A2,…,AiThe mean value of each matrix is calculated and recorded as M1,M2,…,Mi(ii) a The matrix mean value M of each sub-image1,M2,…,MiMerging to obtain a sequence with the length of i as an intermediate hash value; calculating the mean of the sequence
Figure FDA0002446247360000022
Is marked as Md，Md＝median(Mj) Wherein j ═ (1,2, …, i);
s25: will be provided with
Figure FDA0002446247360000023
Comparing with the intermediate hash value one by one, and recording the compared result as binary sequence to obtain hash value H, where H is
Figure FDA0002446247360000024
4. The method for secretly sharing the marine remote sensing image with the dynamic weighting threshold according to claim 3, wherein the shadow information distribution module comprises the following working steps:
s31, calculating prime number N on the basis of the O-Mignotte sequence, wherein the calculation formula is that N is αβ;
s32: calculating a prime number g with the formula of g[(α-1)(β-1)/2]≡1mod N；
S33: will { g, N, omega }iThe bulletin board is released;
s34: partitioning the secret image, extracting a gray value matrix of the secret image, and calculating a hash value sequence H of the secret image;
s35: calculating a secret image S, wherein the calculation formula is S ═ Decimal (H);
s36: according to participationWeight calculation of the subconjunctival shares SiThe calculation formula is
Figure FDA0002446247360000025
Wherein i is 1,2, …, n;
s37: calculating shadow information siThe calculation formula is
Figure FDA0002446247360000026
S38: shadow information siTo each participant UiAnd (5) storing.
5. The method for secretly sharing the marine remote sensing image with the dynamic weighting threshold according to claim 1, wherein the secret image recovery module comprises the following specific steps:
s41: let the sum of the weights of k participants be t, and the participants be { U1,U2,…,Uk}；
S42: judging whether the number of members changes, if not, entering step S43, if so, entering step S46, and if so, entering step S411;
s43: the number of members is unchanged, and
Figure FDA0002446247360000027
participants join to access the bulletin board;
s44: each participant downloads g from the bulletin board and computes a secret share Si；
S45: based on the Chinese remainder theorem, the image is restored, and the calculation formula is
Figure FDA0002446247360000031
S46: the number of members is increased and new member U is setn+1Adding and updating the set of participants to be { U1,U2,…,Un,Un+1}，Un+1Has a weight of ωn+1；
S47: update the O-Mignotte sequence to
Figure FDA0002446247360000032
S48, recalculating the values α, β and N, g;
s49: calculating new sub-secrets according to the new member weight, and keeping the rest sub-secrets unchanged;
s410: repeating the steps S41-S45 to restore the image;
s411: the number of members is reduced, and the member U is providedjQuit, update the set of participants as { U1,…,Uj-1,Uj+1,…,Un}，Un+1Has a weight of ωj；
S412: update the O-Mignotte sequence to
Figure FDA0002446247360000033
S413, recalculating α, β and N, g values;
s414: according to the number U of the leaving memberjEliminating the sub-secret SjThe other sub-secrets remain unchanged;
s415: repeating the steps S41-S45 to restore the image.
CN201710259920.9A 2017-04-20 2017-04-20 Ocean remote sensing image secret sharing method of dynamic weighting threshold Active CN107070638B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710259920.9A CN107070638B (en) 2017-04-20 2017-04-20 Ocean remote sensing image secret sharing method of dynamic weighting threshold

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710259920.9A CN107070638B (en) 2017-04-20 2017-04-20 Ocean remote sensing image secret sharing method of dynamic weighting threshold

Publications (2)

Publication Number Publication Date
CN107070638A CN107070638A (en) 2017-08-18
CN107070638B true CN107070638B (en) 2020-06-23

Family

ID=59599935

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710259920.9A Active CN107070638B (en) 2017-04-20 2017-04-20 Ocean remote sensing image secret sharing method of dynamic weighting threshold

Country Status (1)

Country Link
CN (1) CN107070638B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11436471B2 (en) * 2017-10-13 2022-09-06 Panasonic Intellectual Property Corporation Of America Prediction model sharing method and prediction model sharing system
TWI692743B (en) * 2018-01-08 2020-05-01 國立高雄科技大學 A color image authentication method and computer program product based on palette compression technique
CN110071796B (en) * 2018-01-22 2021-09-03 中山大学 Computing method based on shared secret
CN111177746A (en) * 2019-12-12 2020-05-19 中国科学院深圳先进技术研究院 Efficient visual secret sharing method with core participants
CN111030811B (en) * 2019-12-13 2022-04-22 支付宝(杭州)信息技术有限公司 Data processing method
CN111444521B (en) * 2020-02-21 2023-09-01 成都信息工程大学 Image secret sharing method based on threshold increase and digital signature system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102142129A (en) * 2011-03-09 2011-08-03 西安理工大学 Visual secret sharing-based image content tampering detection method

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2697687C (en) * 2010-03-24 2014-02-18 Diversinet Corp. Method and system for secure communication using hash-based message authentication codes
EP2518932A3 (en) * 2010-10-05 2015-11-18 Brandenburgische Technische Universität Cottbus-Senftenberg A method of password-based authentication and session key agreement for secure data transmission, a method for securely transmitting data, and an electronic data transmission system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102142129A (en) * 2011-03-09 2011-08-03 西安理工大学 Visual secret sharing-based image content tampering detection method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Research on Integration System with Integrative Updating on Multi-source;Huang Dongmei，Qiao Huan，Gao Yanming，Xie Wenhui;《IEEE》;20110113;全文 *
带权门限图像秘密共享方案的研究;马舒;《CNKI中国优秀硕士学位论文全文数据库信息科技辑2016年第3期》;20160315;全文 *

Also Published As

Publication number Publication date
CN107070638A (en) 2017-08-18

Similar Documents

Publication Publication Date Title
CN107070638B (en) Ocean remote sensing image secret sharing method of dynamic weighting threshold
CN105847629B (en) A kind of reversible information hidden method of encrypted image
Lin et al. Invertible secret image sharing with steganography
CN110795762B (en) Reserved format encryption method based on stream cipher
CN106549770A (en) SM2 digital signature generation method and system
CN106603231A (en) Distributed SM2 digital signature generation method and system based on de-secrecy
Chang et al. A sudoku-based secret image sharing scheme with reversibility
Sardar et al. A new lossless secret color image sharing scheme with small shadow size
CN104200424A (en) Difference conversion based (K, N) meaningful image sharing and recovering method
CN109800585A (en) A kind of image interpolation space completely reversibility separates ciphertext domain Information Hiding Algorithms
CN104601596A (en) Data privacy protection method in classification data mining system
Youmaran et al. An improved visual cryptography scheme for secret hiding
CN104881838B (en) One kind is based on GF (23) (K, N) significant point deposited without expansion image and reconstructing method
CN104657494A (en) Access method for website database
Chen et al. Visual secret sharing with cheating prevention revisited
CN112966283A (en) PPARM (vertical partition data parallel processor) method for solving intersection based on multi-party set
CN112152807A (en) Two-party collaborative digital signature method based on SM2 algorithm
CN104660705B (en) A kind of site databases background process method
CN115766962A (en) Multi-key image encryption method based on five-dimensional conservative hyperchaotic system
Yuan et al. Secret image sharing scheme with threshold changeable capability
CN112152808B (en) Multi-party collaborative digital signature method based on SM2 algorithm
CN106530197A (en) Image encryption method based on Kent mapping and generalized Gray codes
Srividhya et al. Implementation of TiOISSS with meaningful shadows and with an additional authentication image
Yang et al. Intragroup and intergroup secret image sharing based on homomorphic Lagrange interpolation
CN108111485B (en) Sub-key generation method and device and key reduction method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant