CN116108506A - Meta-universe digital asset security management system - Google Patents
Meta-universe digital asset security management system Download PDFInfo
- Publication number
- CN116108506A CN116108506A CN202310382409.3A CN202310382409A CN116108506A CN 116108506 A CN116108506 A CN 116108506A CN 202310382409 A CN202310382409 A CN 202310382409A CN 116108506 A CN116108506 A CN 116108506A
- Authority
- CN
- China
- Prior art keywords
- string
- digital
- suffix
- digital asset
- sequence
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
-
- 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
-
- 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/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Abstract
The invention relates to the field of data compression and transmission, in particular to a meta-universe digital asset security management system, which comprises: the digital asset processing system comprises a digital asset acquisition module, a digital asset signature module, a digital asset compression module, a digital asset encryption module and a digital asset weight determination module, wherein the digital asset is acquired, digital signatures are carried out on the digital asset, a sequence to be processed and an initial Huffman tree are acquired, numbers or digital strings in the sequence to be processed are encoded according to the Huffman tree, compression results are obtained, and large-frequency digital strings appearing in the sequence to be processed are dynamically added into the Huffman tree in the encoding process. Encrypting the compression result and the initial Huffman tree to obtain ciphertext data, and carrying out creator identity verification and digital asset storage according to the ciphertext data. Compared with Huffman coding, the invention has higher compression efficiency and ensures the safety of digital assets.
Description
Technical Field
The invention relates to the field of data compression and transmission, in particular to a meta-universe digital asset security management system.
Background
The metauniverse is a virtual world which is constructed by human beings by using digital technology and corresponds to or exceeds the real world and can interact with the realization world, and is a digital living space with a novel social system. The metauniverse has independent economic systems, and the elements for supporting the metauniverse economic systems mainly comprise: digital creation, digital currency, digital assets, digital markets, and the like.
The meta-universe has compatibility and can accommodate people and things in any scale. In the meta-universe, anyone and any party can create digital assets that can be used for circulation in the meta-universe. After the creator creates the digital asset, the digital asset needs to be transmitted to the metauniverse, and the metauniverse verifies the identity and stores the digital asset in the blockchain, so that the digital asset is ensured to be indistinct, indistinct and unique.
In order to ensure the security and timeliness of digital assets in their transmission to the meta-universe, the digital assets need to be encrypted and compressed. The existing compression algorithm such as Huffman coding has higher data compression efficiency for larger frequency difference, but the average code length after the Huffman coding compression is the entropy of the data, and the compression efficiency cannot break through the limitation of the data entropy.
Disclosure of Invention
In order to solve the above problems, the present invention provides a metauniverse digital asset security management system, the system comprising:
the digital asset acquisition module acquires digital assets authored by an author;
a digital asset signature module, wherein an creator digitally signs the digital asset;
the digital asset compression module is used for converting the digital asset and the digital signature into a sequence to be processed; constructing a Huffman tree of a sequence to be processed as an initial Huffman tree, and constructing a null coding sequence and a null coded sequence;
compressing the sequence to be processed according to the initial Huffman tree, comprising:
s1: respectively taking a first number and a second number in a sequence to be processed as a leading number string and a suffix, respectively acquiring codes of the leading number string and the suffix in a Huffman tree, sequentially adding the codes into a code sequence, and sequentially adding the leading number string and the suffix into the coded sequence;
s2: s3, if the sum of the length of the code of the leading digit string and the length of the code of the suffix is less than or equal to the sum of the length of the code of the leading digit string and the length of the code of the suffix, executing the step S, otherwise, splicing the suffix to the leading digit string to obtain the digit string to be added;
when the node corresponding to the leading digit string in the Huffman tree has no branch or only one branch, the digit string to be added is added into the Huffman tree; when two branches exist at a node corresponding to a leading digital string in the Huffman tree, taking the number or the digital string corresponding to the branch as a candidate digital string, respectively acquiring the frequencies of the candidate digital string and the digital string to be added, and updating the Huffman tree according to the frequencies of the candidate digital string and the digital string to be added;
s3: taking the suffix as a new prepositive digit string, obtaining a new suffix, and carrying out matching operation according to the new suffix to obtain the latest suffix code; adding the latest suffix code to the code sequence, and adding the latest suffix to the coded sequence;
s4: repeating S2 to S3 until each number in the sequence to be processed has been added to the encoded sequence, stopping the iteration; taking the coding sequence as a compression result;
the digital asset encryption module encrypts the compression result and the initial Huffman tree to obtain ciphertext data;
and the digital asset right determining module restores the ciphertext data, verifies the creator identity according to the restoring result, and stores the digital asset into the blockchain after the creator identity passes the verification.
Preferably, the adding the to-be-added digit string to the huffman tree includes the steps of:
when the node corresponding to the leading digit string of the Huffman tree has no branch, adding a left branch to the node corresponding to the leading digit string, adding the digit string to be added to the node corresponding to the left branch, and when one branch exists in the node corresponding to the leading digit string of the Huffman tree, adding a right branch to the node corresponding to the leading digit string, and adding the digit string to be added to the node corresponding to the right branch.
Preferably, the step of obtaining frequencies of the candidate digital string and the digital string to be added respectively includes the steps of:
the length of the candidate data string is marked as L, the number of digits in the coded sequence is marked as N, the number of times of each candidate data string in the coded sequence is obtained, the number of times is divided by (N-L+1), and the obtained result is used as the frequency of each candidate data string; dividing the number of occurrences of the string of digits to be added in the encoded sequence by (N-L + 1) to obtain the frequency of the string of digits to be added.
Preferably, the step of updating the huffman tree according to the candidate digital string and the frequency of the digital string to be added includes the steps of:
when the frequency of the digital string to be added is smaller than or equal to the frequency of the two candidate data strings, the Huffman tree is not updated; when the frequency of the digital string to be added is larger than that of the two candidate data strings or larger than that of one candidate data string, deleting all branches of the candidate data string with the minimum frequency and nodes corresponding to the candidate data string with the minimum frequency from the Huffman tree, and adding the digital string to be added to the original node of the candidate data string with the minimum frequency.
Preferably, the matching operation is performed according to the new suffix, so as to obtain the latest suffix code, which includes the following steps:
taking the next number after the suffix in the sequence to be processed as a replacement suffix, splicing the replacement suffix after the suffix as a number string to be matched, and when the number string to be matched does not exist in the Huffman tree, acquiring a corresponding code of the suffix in the Huffman tree as a code of the suffix; when the number strings to be matched exist in the Huffman tree, the number strings to be matched are used as new suffixes;
and repeating the matching operation according to the new suffix until the latest suffix code is obtained, and stopping iteration.
The embodiment of the invention has at least the following beneficial effects: the invention obtains the digital asset of the metauniverse terminal, carries on the digital signature to the digital asset, transforms the digital asset and digital signature into the sequence to be processed, obtains the initial Huffman tree according to the frequency of each digit in the sequence to be processed, encodes the digit or the digit string in the sequence to be processed according to the Huffman tree, gets the compression result, in the encoding process, adds the frequency big digit string appearing in the sequence to be processed into the Huffman tree dynamically, makes the digit string composed of a plurality of digits in the sequence to be processed encode into a shorter code, on the basis of Huffman encoding, further improves the compression effect, makes the subsequent encrypting efficiency of the compression result higher, and improves the transmission efficiency of the digital asset to the metauniverse. The invention compresses and encrypts the digital asset and the digital signature together, so that an attacker cannot replace the digital signature to steal the digital asset under the condition of not mastering the encryption key, thereby ensuring the security in the transmission process of the digital asset.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions and advantages of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are only some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
FIG. 1 is a system block diagram of a metauniverse digital asset security management system provided by one embodiment of the invention.
Detailed Description
In order to further describe the technical means and effects adopted by the invention to achieve the preset aim, the following detailed description is given below of a meta-space digital asset security management system according to the invention, which is provided by combining the attached drawings and the preferred embodiment. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of the metauniverse digital asset security management system provided by the invention with reference to the accompanying drawings.
Referring to FIG. 1, a system for security management of metauniverse digital assets is shown, which comprises the following modules:
the digital asset acquisition module S001 is configured to acquire a digital asset to be authorized.
It should be noted that the meta-universe has compatibility and can accommodate people and things in any scale. In the meta-universe, anyone and any party can create digital assets that can be used for circulation in the meta-universe. When an individual or a group creates a digital asset on a metauniverse terminal, the digital asset is required to be sent to the metauniverse, after the metauniverse is verified by an creator, the digital asset is stored in a blockchain to obtain the NTF (non-homogeneous universal certificate) of the digital asset, so that the right of the digital asset is ensured, and the digital asset is ensured to be indistinctable, irreplaceable, unique and the like.
In the embodiment of the invention, the digital asset created by the creator is acquired at the metauniverse terminal, and the digital asset is not yet authorized at this time, so the digital asset is recorded as the digital asset to be authorized, and is abbreviated as the digital asset. The meta-universe terminal comprises any device which can be accessed to the meta-universe, such as a mobile phone, a computer, an internet of things device, an intelligent wearable device and the like.
Thus, the digital asset to be authorized on the meta-universe terminal is obtained.
The digital asset signature module S002 is configured to sign a digital asset.
In order to ensure the security of digital assets, the creator needs to sign the digital asset.
In the embodiment of the invention, an author signs the digital asset authored by the author by using the private key of the author to generate a digital signature.
Thus, signing of the digital asset is completed.
The digital asset compression module S003 is configured to compress a digital asset.
In the existing authority-determining mode, the digital asset authored by the originator is signed by the metauniverse terminal through the private key of the originator, the digital asset and the digital signature are generated to the metauniverse, the metauniverse verifies the identity of the originator according to the public key of the sender, and after the verification is passed, the metauniverse stores the digital asset in the blockchain. In this mode, however, an attacker may intercept the transmitted message from the metauniverse terminal, replace the digital signature of the creator with the digital signature of the attacker, and transmit the digital signature to the metauniverse, which verifies according to the public key of the sender, and may erroneously identify the owner of the digital asset as the attacker, so that the digital asset is stolen by the attacker. Therefore, the digital asset and the digital signature are also required to be encrypted, and an attacker cannot realize the replacement of the digital signature without knowing the key, so that the security of the digital asset is ensured. In order to improve the encryption and transmission efficiency of digital assets, digital signatures, the digital assets and digital signatures first need to be compressed.
It should be further noted that the digital assets created by the creator include, but are not limited to, digital images, digital artwork, digital music. To facilitate unified compression, digital assets need to be encoded into a unified format, and at the bottom of a computer, all data storage and transmission are performed in binary form, so that digital assets can be encoded into binary form before further processing.
In the embodiment of the invention, the digital asset and the digital signature are encoded into binary forms by utilizing the existing encoding algorithm, each k bits of the obtained binary data are divided into one group, each group of binary data is converted into decimal numbers, and the sequence formed by all the obtained decimal numbers according to the sequence is used as a sequence to be processed. Where k is a preset value and is recorded as a preset first value, in the embodiment of the present invention, k=8, and in other embodiments, the operator may set the value of k according to the actual implementation situation.
The huffman code assigns shorter codes to the more frequent characters and longer codes to the less frequent characters, thereby achieving overall compression of the data. The average code length after Huffman coding compression is the entropy of the data, and the compression efficiency cannot break through the limitation of the data entropy. The invention compresses the sequence to be processed by combining the repeated digit strings in the sequence to be processed on the basis of Huffman coding, and further improves the compression efficiency of the sequence to be processed on the basis of Huffman coding.
In the embodiment of the invention, firstly, the types of all numbers appearing in a sequence to be processed and the frequency of each number are counted, and a Huffman tree is constructed according to the frequency of each number to be used as an initial Huffman tree.
Constructing a null coding sequence and a null coded sequence, and compressing the sequence to be processed according to an initial Huffman tree, wherein the method specifically comprises the following steps:
1. and taking the first number and the second number (namely the first element and the second element) in the sequence to be processed as a leading number string and a suffix respectively, sequentially acquiring codes corresponding to the leading number string and the suffix in the Huffman tree as codes of the first number and the second number in the sequence to be processed, sequentially adding the codes of the first number and the second number into the code sequence, and sequentially adding the first number and the second number into the coded sequence.
2. The length of the code of the leading digit string is recorded as
The length of the suffix code is recorded as
If (if)
Splicing the suffix to the preposed digit string to obtain a digit string to be added; otherwise, executing the step 3.
If the node corresponding to the leading digit string of the Huffman tree has no branch or only one branch, adding one branch to the node corresponding to the leading digit string to obtain a node corresponding to a new branch, adding the digit string to be added to the node, and the code of the node in the Huffman tree is the code of the digit string to be added. When a branch is added to a node without a branch, a left branch is added; when a branch is added for a node with only one branch, the right branch is added;
if two branches exist at the node corresponding to the front digit string of the Huffman tree, respectively acquiring numbers or digit strings corresponding to the two branches as candidate digit strings, marking the length of the candidate data strings as L, marking the number of numbers in the coded sequence as N, acquiring the frequency of each candidate data string in the coded sequence, and dividing the frequency by (N-L+1) to obtain the frequency of each candidate data string. Similarly, the frequency of the string of digits to be added is obtained by dividing the number of occurrences of the string of digits to be added in the encoded sequence by (N-L+1).
When the frequency of the digital string to be added is smaller than or equal to the frequency of the two candidate data strings, the digital string to be added is not added, and the step 3 is executed; and deleting the candidate data string with the minimum frequency from the Huffman tree when the frequency of the digital string to be added is larger than that of the two candidate data strings or larger than that of one candidate data string, and adding the digital string to be added to the original node of the deleted candidate data string. When the node corresponding to the candidate data string with the smallest frequency has a branch, the branch of the corresponding node is deleted together when the candidate data string with the smallest frequency is deleted.
3. Taking the suffix as a new leading number string, and taking the next number after the leading number string in the sequence to be processed as a new suffix;
the matching operation is carried out according to the new suffix, specifically:
taking the next number after the suffix in the sequence to be processed as a replacement suffix, splicing the replacement suffix after the suffix as a number string to be matched, and if the number string to be matched does not exist in the Huffman tree, acquiring a corresponding code of the suffix in the Huffman tree; if the number strings to be matched exist in the Huffman tree, the number strings to be matched are used as new suffixes.
And repeating the matching operation according to the new suffix until the new suffix is obtained and the iteration is stopped when the corresponding code of the new suffix in the Huffman tree is obtained. The encoding of the new suffix is added to the encoded sequence and the new suffix is added to the encoded sequence.
4. Steps 2 through 3 are repeated until each digit in the sequence to be processed has been traversed (i.e., each digit in the sequence to be processed has been added to the encoded sequence) and iteration is stopped. The encoded sequence is taken as the final compression result.
Thus, the compression of the digital asset and the digital signature is realized, and the compression result is obtained.
It should be noted that, in the embodiment of the invention, the digital asset of the meta-universe terminal is obtained, the digital asset is digitally signed, the digital asset and the digital signature are converted into the sequence to be processed, the initial huffman tree is obtained according to the frequency of each digit in the sequence to be processed, the digits or the digit strings in the sequence to be processed are encoded according to the huffman tree, the compression result is obtained, in the encoding process, the digit strings with large frequency appearing in the sequence to be processed are dynamically added into the huffman tree, so that the digit strings formed by a plurality of digits in the sequence to be processed can be encoded into a shorter code, on the basis of the huffman encoding, the compression effect is further improved, the subsequent encrypting efficiency of the compression result is higher, and the transmission efficiency of the digital asset to the meta-universe is improved.
The digital asset encryption module S004 is configured to encrypt the digital asset.
And encrypting the compression result and the initial Huffman tree by using an AES encryption algorithm to obtain ciphertext data. In other embodiments, the practitioner may encrypt the compression result using other encryption algorithms.
Thus, encryption of the digital asset is realized, and ciphertext data is obtained.
It should be noted that, in the embodiment of the invention, the digital asset and the digital signature are compressed and encrypted together, so that an attacker cannot steal the digital asset by replacing the digital signature without grasping the encryption key, thereby ensuring the security in the transmission process of the digital asset.
And the digital asset right confirming module S005 is used for verifying and linking the digital asset to realize the right confirmation of the digital asset.
And the meta-universe terminal transmits the ciphertext data to the meta-universe, and the meta-universe receives the ciphertext data and then decrypts the ciphertext data to obtain a compression result and an initial Huffman tree.
An empty decompression sequence is constructed, and compression results are decompressed according to an initial Huffman tree, specifically:
1. and sequentially acquiring numbers corresponding to the first element and the second element in the compressed result in the Huffman tree, respectively serving as decompression results of the first element and the second element, and sequentially adding the decompression results into a decompression sequence. The decompression results of the first element and the second element are respectively used as a leading digit string and a suffix, wherein the first element is the code of the leading digit string, and the second element is the code of the suffix.
2. The length of the code of the leading digit string is recorded as
The length of the suffix code is recorded as
If (if)
Splicing the suffix to the preposed digit string to obtain a digit string to be added; otherwise, executing the step 3.
If the node corresponding to the leading digit string in the Huffman tree has no branch or only one branch, adding one branch to the node corresponding to the leading digit string to obtain a node corresponding to a new branch, adding the digit string to be added to the node, and the code of the node in the Huffman tree is the code of the digit string to be added. When a branch is added to a node without a branch, a left branch is added;
if two branches exist at the node corresponding to the leading digit string in the Huffman tree, respectively acquiring the digit strings corresponding to the two branches as candidate digit strings, marking the length of the candidate digit strings as L, marking the number of digits in the decompression sequence as N, acquiring the frequency of each candidate data string in the decompression sequence, and dividing the frequency by (N-L+1) to obtain the frequency of each candidate data string. And similarly, acquiring the frequency of the digital string to be added.
When the frequency of the digital string to be added is smaller than or equal to the frequency of the two candidate data strings, the digital string to be added is not added, and the step 3 is executed; and deleting the candidate data string with the minimum frequency from the Huffman tree when the frequency of the digital string to be added is larger than the frequency of the two candidate data strings or one of the candidate data strings, and adding the digital string to be added to the original node of the deleted candidate data string. When the node corresponding to the candidate data string with the smallest frequency has a branch, the branch of the corresponding node is deleted together when the candidate data string with the smallest frequency is deleted.
3. And taking the suffix as a new leading number string, acquiring a number or a number string corresponding to the next element in the compressed result in the Huffman tree, taking the number or the number string as a decompression result of the element, adding the decompression result into a decompression sequence, and taking the decompression result as a new suffix.
4. Repeating steps 2 to 3 until each element in the compression result has been decompressed, stopping the iteration. The decompression sequence is the result of decompressing the compression result.
And converting decimal numbers in the decompression sequence into binary forms, and decoding binary data by utilizing a coding algorithm in the digital asset compression module to obtain digital assets and digital signatures.
The meta universe verifies the digital signature according to the public key of the sender and determines the identity of the creator. After verification passes, the meta-universe stores the digital asset to the blockchain, at which point the digital asset is indivisible, irreplaceable and unique.
Thus, the validation of the digital asset is completed. The safety management of the metauniverse digital assets is realized.
In summary, the system of the present invention includes a digital asset acquisition module, a digital asset signature module, a digital asset compression module, a digital asset encryption module, and a digital asset validation module, and in the embodiment of the present invention, digital assets of a metauniverse terminal are acquired, digital signatures are performed on the digital assets, the digital assets and the digital signatures are converted into a sequence to be processed, an initial huffman tree is acquired according to the frequency of each digit in the sequence to be processed, a number or a number string in the sequence to be processed is encoded according to the huffman tree, a compression result is obtained, and in the encoding process, a number string with a large frequency appearing in the sequence to be processed is dynamically added to the huffman tree, so that a number string composed of a plurality of digits in the sequence to be processed can be encoded into a shorter code, and the compression effect is further improved on the basis of the huffman encoding. The embodiment of the invention compresses and encrypts the digital asset and the digital signature together, so that an attacker cannot replace the digital signature to steal the digital asset under the condition of not mastering the encryption key, thereby ensuring the security in the transmission process of the digital asset.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (5)
1. A metauniverse digital asset security management system, the system comprising:
the digital asset acquisition module acquires digital assets authored by an author;
a digital asset signature module, wherein an creator digitally signs the digital asset;
the digital asset compression module is used for converting the digital asset and the digital signature into a sequence to be processed; constructing a Huffman tree of a sequence to be processed as an initial Huffman tree, and constructing a null coding sequence and a null coded sequence;
compressing the sequence to be processed according to the initial Huffman tree, comprising:
s1: respectively taking a first number and a second number in a sequence to be processed as a leading number string and a suffix, respectively acquiring codes of the leading number string and the suffix in a Huffman tree, sequentially adding the codes into a code sequence, and sequentially adding the leading number string and the suffix into the coded sequence;
s2: s3, if the sum of the length of the code of the leading digit string and the length of the code of the suffix is less than or equal to the sum of the length of the code of the leading digit string and the length of the code of the suffix, executing the step S, otherwise, splicing the suffix to the leading digit string to obtain the digit string to be added;
when the node corresponding to the leading digit string in the Huffman tree has no branch or only one branch, the digit string to be added is added into the Huffman tree; when two branches exist at a node corresponding to a leading digital string in the Huffman tree, taking the number or the digital string corresponding to the branch as a candidate digital string, respectively acquiring the frequencies of the candidate digital string and the digital string to be added, and updating the Huffman tree according to the frequencies of the candidate digital string and the digital string to be added;
s3: taking the suffix as a new prepositive digit string, obtaining a new suffix, and carrying out matching operation according to the new suffix to obtain the latest suffix code; adding the latest suffix code to the code sequence, and adding the latest suffix to the coded sequence;
s4: repeating S2 to S3 until each number in the sequence to be processed has been added to the encoded sequence, stopping the iteration; taking the coding sequence as a compression result;
the digital asset encryption module encrypts the compression result and the initial Huffman tree to obtain ciphertext data;
and the digital asset right determining module restores the ciphertext data, verifies the creator identity according to the restoring result, and stores the digital asset into the blockchain after the creator identity passes the verification.
2. The metauniverse digital asset security management system of claim 1, wherein the adding the string of digits to be added to the huffman tree comprises the steps of:
when the node corresponding to the leading digit string of the Huffman tree has no branch, adding a left branch to the node corresponding to the leading digit string, adding the digit string to be added to the node corresponding to the left branch, and when one branch exists in the node corresponding to the leading digit string of the Huffman tree, adding a right branch to the node corresponding to the leading digit string, and adding the digit string to be added to the node corresponding to the right branch.
3. The metauniverse digital asset security management system of claim 1, wherein the frequency of respectively obtaining the candidate digital string and the digital string to be added comprises the steps of:
the length of the candidate data string is marked as L, the number of digits in the coded sequence is marked as N, the number of times of each candidate data string in the coded sequence is obtained, the number of times is divided by (N-L+1), and the obtained result is used as the frequency of each candidate data string; dividing the number of occurrences of the string of digits to be added in the encoded sequence by (N-L + 1) to obtain the frequency of the string of digits to be added.
4. The metauniverse digital asset security management system of claim 1, wherein the updating huffman tree according to the frequency of the candidate digital string and the digital string to be added comprises the steps of:
when the frequency of the digital string to be added is smaller than or equal to the frequency of the two candidate data strings, the Huffman tree is not updated; when the frequency of the digital string to be added is larger than that of the two candidate data strings or larger than that of one candidate data string, deleting all branches of the candidate data string with the minimum frequency and nodes corresponding to the candidate data string with the minimum frequency from the Huffman tree, and adding the digital string to be added to the original node of the candidate data string with the minimum frequency.
5. The metauniverse digital asset security management system of claim 1, wherein the matching operation according to the new suffix, to obtain the latest suffix code, comprises the steps of:
taking the next number after the suffix in the sequence to be processed as a replacement suffix, splicing the replacement suffix after the suffix as a number string to be matched, and when the number string to be matched does not exist in the Huffman tree, acquiring a corresponding code of the suffix in the Huffman tree as a code of the suffix; when the number strings to be matched exist in the Huffman tree, the number strings to be matched are used as new suffixes;
and repeating the matching operation according to the new suffix until the latest suffix code is obtained, and stopping iteration.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310382409.3A CN116108506B (en) | 2023-04-12 | 2023-04-12 | Meta-universe digital asset security management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310382409.3A CN116108506B (en) | 2023-04-12 | 2023-04-12 | Meta-universe digital asset security management system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116108506A true CN116108506A (en) | 2023-05-12 |
| CN116108506B CN116108506B (en) | 2023-06-23 |
Family
ID=86265870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310382409.3A Active CN116108506B (en) | 2023-04-12 | 2023-04-12 | Meta-universe digital asset security management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116108506B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116489369A (en) * | 2023-06-26 | 2023-07-25 | 深圳市美力高集团有限公司 | Driving digital video compression processing method |
| CN116756383A (en) * | 2023-08-18 | 2023-09-15 | 凯尔菱电（山东）电梯有限公司 | Elevator data management system and method based on Internet of Things |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5532694A (en) * | 1989-01-13 | 1996-07-02 | Stac Electronics, Inc. | Data compression apparatus and method using matching string searching and Huffman encoding |
| US5970177A (en) * | 1995-06-07 | 1999-10-19 | America Online, Inc. | Data compression using selective encoding |
| US9209833B1 (en) * | 2015-06-25 | 2015-12-08 | Emc Corporation | Methods and apparatus for rational compression and decompression of numbers |
| KR20160100496A (en) * | 2015-02-15 | 2016-08-24 | 김정훈 | Improved huffman code method and apprartus thereof by using binary clusters |
| CN114218591A (en) * | 2021-12-17 | 2022-03-22 | 上海旺链信息科技有限公司 | Digital asset management method capable of realizing anonymous transaction |
| CN114707973A (en) * | 2022-03-08 | 2022-07-05 | 中科计算技术创新研究院 | Method and protocol for managing downlink and uplink coordinated digital assets of chain oriented to metauniverse application |
| WO2022148304A1 (en) * | 2021-01-07 | 2022-07-14 | 苏州浪潮智能科技有限公司 | Sorting network-based dynamic huffman coding method, apparatus and device |
-
2023
- 2023-04-12 CN CN202310382409.3A patent/CN116108506B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5532694A (en) * | 1989-01-13 | 1996-07-02 | Stac Electronics, Inc. | Data compression apparatus and method using matching string searching and Huffman encoding |
| US5970177A (en) * | 1995-06-07 | 1999-10-19 | America Online, Inc. | Data compression using selective encoding |
| KR20160100496A (en) * | 2015-02-15 | 2016-08-24 | 김정훈 | Improved huffman code method and apprartus thereof by using binary clusters |
| US9209833B1 (en) * | 2015-06-25 | 2015-12-08 | Emc Corporation | Methods and apparatus for rational compression and decompression of numbers |
| WO2022148304A1 (en) * | 2021-01-07 | 2022-07-14 | 苏州浪潮智能科技有限公司 | Sorting network-based dynamic huffman coding method, apparatus and device |
| CN114218591A (en) * | 2021-12-17 | 2022-03-22 | 上海旺链信息科技有限公司 | Digital asset management method capable of realizing anonymous transaction |
| CN114707973A (en) * | 2022-03-08 | 2022-07-05 | 中科计算技术创新研究院 | Method and protocol for managing downlink and uplink coordinated digital assets of chain oriented to metauniverse application |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116489369A (en) * | 2023-06-26 | 2023-07-25 | 深圳市美力高集团有限公司 | Driving digital video compression processing method |
| CN116489369B (en) * | 2023-06-26 | 2023-09-08 | 深圳市美力高集团有限公司 | Driving digital video compression processing method |
| CN116756383A (en) * | 2023-08-18 | 2023-09-15 | 凯尔菱电（山东）电梯有限公司 | Elevator data management system and method based on Internet of Things |
| CN116756383B (en) * | 2023-08-18 | 2023-11-21 | 凯尔菱电（山东）电梯有限公司 | Elevator data management system and method based on Internet of Things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116108506B (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116108506B (en) | Meta-universe digital asset security management system | |
| US6122379A (en) | Method and apparatus for performing simultaneous data compression and encryption | |
| JP2004534333A (en) | Integrated protection method and system for distributed data processing in computer networks | |
| US20080126378A1 (en) | Method and system for certificate revocation list compression | |
| US20080189545A1 (en) | Method and system for certificate revocation list pre-compression encoding | |
| CN1279851A (en) | Virtual matrix encryption (VME) and virtual key cryptographic method and aparatus | |
| CN115842621B (en) | Intelligent medical system based on big data and cloud edge cooperation | |
| CN112600665A (en) | Covert communication method, device and system based on block chain and encryption technology | |
| CN112491832B (en) | File transmission method and device | |
| CN116151740B (en) | Inventory transaction data process safety management system and cloud platform | |
| CN104598801B (en) | A kind of Dynamic Two-dimensional code generating method based on algorithm reconstruct | |
| CN116781420B (en) | Electronic file secure transmission encryption method and system | |
| CN115426101A (en) | Data transmission method of cloud intercommunication platform | |
| Hua et al. | Matrix-based secret sharing for reversible data hiding in encrypted images | |
| SubhamastanRao et al. | Simultaneous data compression and encryption | |
| Yu et al. | Reversible data hiding in encrypted images with secret sharing and hybrid coding | |
| CN116664123A (en) | Digital wallet design method based on blockchain technology | |
| CN112118087A (en) | Cross-chain contract compression encryption system and method | |
| CN115150134A (en) | Intelligent power grid data encryption transmission method and system | |
| CN114065269A (en) | Method for generating and analyzing bindless heterogeneous token and storage medium | |
| CN113986853A (en) | Block chain data storage and sharing method, system, equipment and terminal | |
| Kumar et al. | Data hiding scheme for medical images using lossless code for mobile HIMS | |
| Ryabko | Unconditionally secure short key ciphers based on data compression and randomization | |
| CN109788160A (en) | Image transfer method, device, electronic equipment and storage medium | |
| Bhardwaj et al. | An Approach for Enhancing Data Storage Capacity in Quick Response Code using Zip Compression Technique |
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 |