Iot embedded watermark image ownership authorization and batch public verification method

Abstract

The application discloses a kind of ownership authorization and batch public verification methods of Internet of Things embedded watermark image, by generating public-private key pair, generating homomorphic label, inserting watermark, extracting watermark label, aggregating label, verifying label step composition.The application generates homomorphic label step, generates label for each frame image, as watermark is embedded into each frame, reconstructs image using all watermark frames and frequency domain watermark method, solves the technical problem of image content distortion after inserting watermark, realizes the invisibility and robustness of watermark;Verification label step is adopted, anyone holding verification key can verify the copyright of the image by running the verification label method, solves the technical problem that verification takes too much time, realizes public verification and efficient verification efficiency.The application has the advantages of high security, fast verification speed and the like, provides a solution to the technical problems of copyright protection, and is suitable for copyright protection of images, videos and other materials that can be embedded with watermarks.

Description

Technical Field

[0001] This invention belongs to the field of image copyright protection technology in the Internet of Things, specifically involving watermarked digital images. Background Technology

[0002] The essence of the Internet of Things (IoT) is the interconnection of everything. It forms a large-scale, dynamic system by deploying numerous internet-connected terminal nodes such as mobile devices, sensors, home appliances, industrial instruments, and medical equipment. It collects, analyzes, stores, and transmits data in real time, enabling interconnection between terminal nodes and the underlying network environment. IoT technology has been widely applied in many fields, including connected vehicles, smart homes, smart healthcare, smart industry, and bio-big data, becoming an important direction for digitalization, intelligence, and automation. However, illegal attacks targeting devices, environments, and applications have become obstacles to the widespread deployment and application expansion of the IoT, and the issue of privacy data breaches is increasingly prominent. Ensuring the security and privacy of IoT applications has become a crucial requirement for the development of the IoT industry.

[0003] Image data sharing and trading have broad development prospects and practical value in many technological fields of the Internet of Things (IoT). For example, in the Internet of Vehicles (IoV), smart cameras and video surveillance systems can monitor people and vehicles in real time. In the field of smart healthcare, smart cameras can monitor ward conditions and analyze patient conditions, ensuring the real-time, transparent, and efficient sharing of medical information. However, due to the lack of copyright checks on digital images, malicious users can forge entirely new images through copying, compression, cropping, and conversion, and then sell them using others' image works without the knowledge of the copyright holder, increasing the uncertainty and fraud risk in image data sharing. Therefore, achieving the authenticity, reliability, and secure sharing of image data has become a pressing technical problem to be solved in this application.

[0004] Currently, encryption, authentication, and signature technologies can prevent images from being forged, tampered with, or otherwise illegally attacked, thus ensuring the security of image data. Linear homomorphic signatures can sign data, thereby guaranteeing its integrity and authenticity, preventing tampering and fraud in image data sharing. Their homomorphic properties ensure the aggregatability of the signature and the efficiency of verification. Digital watermarking technology can identify and verify images, preventing unauthorized use. Therefore, linear homomorphic signatures and digital watermarking verification technologies not only guarantee the legality and credibility of the data but also ensure the authenticity of the image's origin.

[0005] Traditional methods focus on factors such as image recoverability, embedding capacity, and distortion balance to ensure image integrity and fidelity. However, there is a relative lack of methods that simultaneously guarantee the robustness of digital watermarks and support batch public verification. Relying solely on a single signature or encryption to authorize massive amounts of image data in the Internet of Things would impose a heavy computational and communication burden. Summary of the Invention

[0006] The technical problem to be solved by the present invention is to overcome the shortcomings of the prior art and provide a highly secure, flexible and efficient method for ownership authorization and batch public verification of IoT embedded watermarked images.

[0007] The technical solution adopted to solve the above technical problems consists of the following steps:

[0008] (1) Generate public and private key pairs

[0009] 1) Determine the bilinear group Ψ according to equation (1):

[0010] Ψ=(G1,G2,G T ,e) (1)

[0011] Where, G1, G2, G T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system safety parameter, λ is a finite positive integer, and e is a bilinear mapping.

[0012] 2) Determine the generators g1, g2, ..., g using the following formula. s h:

[0013] g1,g2,...,g s ←G1

[0014] s = n + m

[0015] h←G2

[0016] Among them, generators g1, g2, ..., g s Not equal to 0, m is the total number of frames after image framing, m is a finite positive integer, n is the total number of frames verified, n is a finite positive integer.

[0017] 3) Determine the private key sk and commitment u using the following formula:

[0018] sk←F q

[0019] u=h sk

[0020] Among them, F q It is a finite field of order q for prime numbers.

[0021] 4) Determine the hash function H using the following formula:

[0022] H:I×{1,2,...,m}→G1

[0023] Where I is the identifier space.

[0024] 5) Determine the output public key pk using the following formula:

[0025] pk=(Ψ,H,g1,g2,...,g s ,h,u)

[0026] (2) Generate homomorphic labels

[0027] Determine the homomorphic label t according to formula (2). i :

[0028]

[0029] AU=po||pm||id||ts

[0030] in, yes The (n+i)th component, i∈{1,2,...,m}, yes The j-th component, j∈{1,2,...,n}, It is a frame vector, where po is the image owner identifier, pm is the authorized person identifier, id is the IoT terminal identifier, and ts is the timestamp.

[0031] (3) Insert watermark

[0032] The set of integers Z is determined by the following formula. p :

[0033] Z p ={0,1,...,p-1}

[0034] A watermark is inserted using the conventional discrete cosine transform method, resulting in an image with the watermark inserted.

[0035]

[0036] Where S is the discrete cosine transform watermarking method. yes The i-th component, wk, is the watermark key from the set of integers Z. p The random number selected from the list.

[0037] (4) Extract watermark tags

[0038] Extracting the watermark tag t from the watermark image using the conventional discrete cosine transform method. j :

[0039]

[0040] Where E represents the discrete cosine transform watermark extraction method. Image vectors for watermark embedding.

[0041] (5) Aggregation tag

[0042] Determine the aggregation label T using the following formula:

[0043]

[0044] β j ←F q

[0045] Where, β j It is the coefficient of the j-th frame.

[0046] (6) Verify the label

[0047] 1) Determine the bilinear mapping result γ1 using the following formula:

[0048] γ1=e(Τ,h)

[0049] 2) Determine the verification component γ2 according to the following formula:

[0050]

[0051] 3) Determine if the following expression is satisfied:

[0052] γ1=γ2

[0053] If the conditions are met, the verification passes; otherwise, the verification fails.

[0054] In step (1) of the present invention, which generates a public-private key pair, in equation (1), G1, G2, G... T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system safety parameter, with a value ranging from 60 to 100.

[0055] In step (1) of the present invention, step 2) of generating public and private key pairs, m is the total number of frames after image framing, m takes the value of 6000 to 7000, and n is the total number of verification frames, n takes the value of 600 to 700.

[0056] In step (1) of the present invention, step 2) of generating public and private key pairs, m is the total number of frames after image framing, and the optimal value of m is 6500, and n is the total number of frames for verification, and the optimal value of n is 650.

[0057] Because this invention employs a homomorphic tag generation step, generating tags for each image frame and embedding them as watermarks into each frame, and using all watermarked frames to reconstruct the image and frequency domain watermarking method, it solves the technical problems of content distortion and security degradation, achieving watermark invisibility and security. Furthermore, by employing a tag verification step, anyone holding the verification key can verify the image's copyright by running the tag verification method, solving the technical problem of excessively time-consuming verification and achieving public verification and high verification efficiency. This invention has advantages such as high security and fast verification speed, providing a solution to technical problems in copyright protection, and is applicable to copyright protection of images, videos, and other materials that can be embedded with watermarks. Attached Figure Description

[0058] Figure 1 This is a flowchart of Embodiment 1 of the present invention. Detailed Implementation

[0059] The present invention will be further described below with reference to the accompanying drawings and embodiments, but the present invention is not limited to the embodiments described below.

[0060] Example 1

[0061] The method for ownership authorization and batch public verification of IoT embedded watermarked images in this embodiment consists of the following steps (see...). Figure 1 ):

[0062] (1) Generate public and private key pairs

[0063] 1) Determine the bilinear group Ψ using the following formula:

[0064] Ψ=(G1,G2,G T e)

[0065] Where, G1, G2, G T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system security parameter, λ is a finite positive integer, and λ takes values ​​from 60 to 100. In this embodiment, λ takes a value of 80, and e is a bilinear mapping.

[0066] 2) Determine the generators g1, g2, ..., g using the following formula. s h:

[0067] g1,g2,...,g s ←G1

[0068] s = n + m

[0069] h←G2

[0070] Among them, generators g1, g2, ..., g sNot equal to 0. m is the total number of frames after image framing, with a value of 6000 to 7000. In this embodiment, m is 6500. n is the total number of frames verified, with a value of 600 to 700. In this embodiment, n is 650.

[0071] 3) Determine the private key sk and commitment u using the following formula:

[0072] sk←F q

[0073] u=h sk

[0074] Among them, F q It is a finite field of order q for prime numbers.

[0075] 4) Determine the hash function H using the following formula:

[0076] H:I×{1,2,...,m}→G1

[0077] Where I is the identifier space.

[0078] 5) Determine the output public key pk using the following formula:

[0079] pk=(Ψ,H,g1,g2,...,g s ,h,u)

[0080] (2) Generate homomorphic labels

[0081] Determine the homomorphic label t using the following formula i :

[0082]

[0083] AU=po||pm||id||ts

[0084] in, yes The (n+i)th component, i∈{1,2,...,m}, where m is the total number of frames after image segmentation, and m takes values ​​from 6000 to 7000. In this embodiment, m is 6500. yes The j-th component, j∈{1,2,...,n}, where n is the total number of verification frames, and n takes a value of 600~700. In this embodiment, n takes a value of 650. It is a frame vector, where po is the image owner identifier, pm is the authorized person identifier, id is the IoT terminal identifier, and ts is the timestamp.

[0085] This step generates a label for each frame of the image, which is then embedded as a watermark in each frame. The image is reconstructed using all watermarked frames, and the frequency domain watermarking method is used. This solves the technical problems of content distortion and security reduction, and achieves the invisibility and security of the watermark.

[0086] (3) Insert watermark

[0087] The set of integers Z is determined by the following formula. p :

[0088] Z p ={0,1,...,p-1}

[0089] A watermark is inserted using the conventional discrete cosine transform method, resulting in an image with the watermark inserted.

[0090]

[0091] Wherein, S is the discrete cosine transform watermarking method, which has been disclosed in IJCox, J.Kilian, F.T.Leighton and T.Shamoon, "Secure spread spectrum watermarking for multimedia," in IEEE Transactions on Image Processing, vol.6, no.12, pp.1673-1687, Dec.1997, doi:10.1109 / 83.650120. yes The i-th component, wk, is the watermark key from the set of integers Z. p The random number selected from the list.

[0092] (4) Extract watermark tags

[0093] Extracting the watermark tag t from the watermark image using the conventional discrete cosine transform method. j :

[0094]

[0095] Wherein, E is the discrete cosine transform watermark extraction method, which has been disclosed in IJCox, J.Kilian, F.T.Leighton and T.Shamoon, "Secure spread spectrum watermarking for multimedia," in IEEE Transactions on Image Processing, vol.6, no.12, pp.1673-1687, Dec.1997, doi:10.1109 / 83.650120. Image vectors for watermark embedding.

[0096] (5) Aggregation tag

[0097] Determine the aggregation label T using the following formula:

[0098]

[0099] β j ←F q

[0100] Where, β j It is the coefficient of the j-th frame.

[0101] (6) Verify the label

[0102] 1) Determine the bilinear mapping result γ1 using the following formula:

[0103] γ1=e(Τ,h)

[0104] 2) Determine the verification component γ2 according to the following formula:

[0105]

[0106] 3) Determine if the following expression is satisfied:

[0107] γ1=γ2

[0108] If the conditions are met, the verification passes; otherwise, the verification fails.

[0109] This embodiment employs a verification tag step, allowing anyone holding a verification key to verify the copyright of an image by running the verification tag method. This solves the technical problem of excessively time-consuming verification and achieves both public verification and high verification efficiency.

[0110] A method for authorizing ownership and publicly verifying batches of watermarked images embedded in IoT devices.

[0111] Example 2

[0112] The method for authorizing ownership and verifying batch public access to IoT embedded watermarked images in this embodiment consists of the following steps:

[0113] (1) Generate public and private key pairs

[0114] 1) Determine the bilinear group Ψ according to equation (1):

[0115] Ψ=(G1,G2,G T ,e) (1)

[0116] Where, G1, G2, G T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system security parameter, λ is a finite positive integer, and λ takes values ​​from 60 to 100. In this embodiment, λ takes a value of 60, and e is a bilinear mapping.

[0117] 2) Determine the generators g1, g2, ..., g using the following formula. s h:

[0118] g1,g2,...,g s ←G1

[0119] s = n + m

[0120] h←G2

[0121] Among them, generators g1, g2, ..., g s Not equal to 0, m is the total number of frames after image framing, m takes a value of 6000 to 7000, and m takes a value of 6000 in this embodiment, n is the total number of frames verified, n takes a value of 600 to 700, and n takes a value of 600 in this embodiment.

[0122] The other steps in this procedure are the same as in Example 1.

[0123] (2) Generate homomorphic labels

[0124] Determine the homomorphic label t according to formula (2). i :

[0125]

[0126] AU=po||pm||id||ts

[0127] in, yes The (n+i)th component, i∈{1,2,...,m}, where m is the total number of frames after image framing, and m takes a value of 6000 to 7000. In this embodiment, m is 6000. yes The j-th component, j∈{1,2,...,n}, where n is the total number of frames verified, and n takes a value of 600 to 700. In this embodiment, n takes a value of 600. It is a frame vector, where po is the image owner identifier, pm is the authorized person identifier, id is the IoT terminal identifier, and ts is the timestamp.

[0128] The other steps are the same as in Example 1. This completes the method for authorizing ownership and conducting batch public verification of IoT embedded watermarked images.

[0129] Example 3

[0130] The method for authorizing ownership and verifying batch public access to IoT embedded watermarked images in this embodiment consists of the following steps:

[0131] (1) Generate public and private key pairs

[0132] 1) Determine the bilinear group Ψ using the following formula:

[0133] Ψ=(G1,G2,G T e)

[0134] Where, G1, G2, G T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system security parameter, λ is a finite positive integer, and λ takes values ​​from 60 to 100. In this embodiment, λ takes the value of 100, and e is a bilinear mapping.

[0135] 2) Determine the generators g1, g2, ..., g using the following formula. s h:

[0136] g1,g2,...,g s ←G1

[0137] s = n + m

[0138] h←G2

[0139] Among them, generators g1, g2, ..., g s Not equal to 0, m is the total number of frames after image framing, m takes a value of 6000 to 7000, and m takes a value of 7000 in this embodiment, n is the total number of frames verified, n takes a value of 600 to 700, and n takes a value of 700 in this embodiment.

[0140] The other steps in this procedure are the same as in Example 1.

[0141] (2) Generate homomorphic labels

[0142] Determine the homomorphic label t according to formula (2). i :

[0143]

[0144] AU=po||pm||id||ts

[0145] in, yes The (n+i)th component, i∈{1,2,...,m}, where m is the total number of frames after image framing, and m takes values ​​from 6000 to 7000. In this embodiment, m is 7000. yes The j-th component, j∈{1,2,...,n}, where n is the total number of frames verified, and n takes a value of 600 to 700. In this embodiment, n takes a value of 700. It is a frame vector, where po is the image owner identifier, pm is the authorized person identifier, id is the IoT terminal identifier, and ts is the timestamp.

[0146] The other steps are the same as in Example 1. This completes the method for authorizing ownership and conducting batch public verification of IoT embedded watermarked images.

[0147] To verify the beneficial effects of the present invention, a computer simulation experiment was conducted using the IoT embedded watermark image ownership authorization and batch public verification method of embodiments 1, 2, and 3 of the present invention. The experiment determined the verification time and the probability of forgery detection. The verification time was obtained during the experiment, and the probability P of forgery detection was determined by the following formula:

[0148]

[0149] Where k∈{0,1,...,n+1}

[0150] The experimental and calculation results are shown in Table 1.

[0151] Table 1. Simulation Experiment and Calculation Results of Embodiments 1-3 of the Present Invention

[0152] Example 1 0.298 <![CDATA[1-8.6838×10 -30 ]]> Example 2 0.320 <![CDATA[1-3.3187×10 -32 ]]> Example 3 0.344 <![CDATA[1-1.2683×10 -34 ]]>

[0153] As shown in Table 1, this invention solves the technical problem of excessively time-consuming verification, achieving high verification efficiency. This invention has advantages such as high security and fast verification speed, providing a solution to technical problems in copyright protection, and is applicable to copyright protection of images, videos, and other materials that can be embedded with watermarks.

Claims

1. A method for ownership authorization and batch public verification of IoT embedded watermarked images, characterized in that... It consists of the following steps: (1) Generate public and private key pairs 1) Determine the bilinear group Ψ according to equation (1): Ψ=(G1,G2,G T ,e) (1) Where, G1, G2, G T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system safety parameter, λ is a finite positive integer, and e is a bilinear mapping; 2) Determine the generators g1, g2, ..., g using the following formula. s h: g1,g2,...,g s ←G1 s = n + m h←G2 Among them, generators g1, g2, ..., g s Not equal to 0, m is the total number of frames after image framing, m is a finite positive integer, n is the total number of frames verified, n is a finite positive integer; 3) Determine the private key sk and commitment u using the following formula: sk←F q u=h sk Among them, F q It is a finite field of order q for prime numbers; 4) Determine the hash function H using the following formula: H:I×{1,2,...,m}→G1 Where I is the identifier space; 5) Determine the output public key pk using the following formula: pk=(Ψ,H,g1,g2,...,g s ,h,u) (2) Generate homomorphic labels Determine the homomorphic label t according to formula (2). i : AU=po||pm||id||ts in, yes The (n+i)th component, i∈{1,2,...,m}, yes The j-th component, j∈{1,2,...,n}, It is a frame vector, where po is the image owner identifier, pm is the authorized person identifier, id is the IoT terminal identifier, and ts is the timestamp; (3) Insert watermark The set of integers Z is determined by the following formula. p : Z p ={0,1,...,p-1} A watermark is inserted using the conventional discrete cosine transform method, resulting in an image with the watermark inserted. Where S is the discrete cosine transform watermarking method. yes The i-th component, wk, is the watermark key from the set of integers Z. p The random number selected from the list; (4) Extract watermark tags Extracting the watermark tag t from the watermark image using the conventional discrete cosine transform method. j : Where E represents the discrete cosine transform watermark extraction method. The image vector used to embed the watermark; (5) Aggregation tag Determine the aggregation label T using the following formula: β j ←F q Where, β j It is the coefficient of the j-th frame; (6) Verify the label 1) Determine the bilinear mapping result γ1 using the following formula: γ1=e(Τ,h) 2) Determine the verification component γ2 according to the following formula: 3) Determine if the following expression is satisfied: γ1=γ2 If the conditions are met, the verification passes; otherwise, the verification fails.

2. The method for ownership authorization and batch public verification of IoT embedded watermarked images according to claim 1, characterized in that: In step (1), which generates the public-private key pair, in equation (1), G1, G2, G... T It is a cyclic group of order p consisting of three prime numbers, where p > 2. λ λ is a system safety parameter, with a value ranging from 60 to 100.

3. The method for ownership authorization and batch public verification of IoT embedded watermarked images according to claim 1, characterized in that: In step 2) of generating the public-private key pair in step (1), m is the total number of frames after image framing, with a value of 6000 to 7000, and n is the total number of frames for verification, with a value of 600 to 700.

4. The method for ownership authorization and batch public verification of IoT embedded watermarked images according to claim 1, characterized in that: In step (1) generating the public-private key pair, step 2) states that m is the total number of frames after image framing, with a value of 6500, and n is the total number of frames verified, with a value of 650.

Images