CN114065269A - Method for generating and analyzing bindless heterogeneous token and storage medium - Google Patents

Method for generating and analyzing bindless heterogeneous token and storage medium Download PDF

Info

Publication number
CN114065269A
CN114065269A CN202210040269.7A CN202210040269A CN114065269A CN 114065269 A CN114065269 A CN 114065269A CN 202210040269 A CN202210040269 A CN 202210040269A CN 114065269 A CN114065269 A CN 114065269A
Authority
CN
China
Prior art keywords
information
data
information data
unbound
data elements
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
Application number
CN202210040269.7A
Other languages
Chinese (zh)
Other versions
CN114065269B (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.)
Shenzhen Smart City Technology Development Group Co ltd
Surfilter Network Technology Co ltd
Zhaoshang Xinzhi Technology Co ltd
Peking University Shenzhen Graduate School
Kingdee Software China Co Ltd
Original Assignee
Shenzhen Smart City Technology Development Group Co ltd
Surfilter Network Technology Co ltd
Zhaoshang Xinzhi Technology Co ltd
Peking University Shenzhen Graduate School
Kingdee Software China Co Ltd
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 Shenzhen Smart City Technology Development Group Co ltd, Surfilter Network Technology Co ltd, Zhaoshang Xinzhi Technology Co ltd, Peking University Shenzhen Graduate School, Kingdee Software China Co Ltd filed Critical Shenzhen Smart City Technology Development Group Co ltd
Priority to CN202210040269.7A priority Critical patent/CN114065269B/en
Publication of CN114065269A publication Critical patent/CN114065269A/en
Application granted granted Critical
Publication of CN114065269B publication Critical patent/CN114065269B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/602Providing cryptographic facilities or services
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Storage Device Security (AREA)

Abstract

A generating method and an analyzing method of a non-binding non-homogeneous token and a storage medium are provided, information data corresponding to data elements are obtained, and the information data corresponding to the data elements comprise: name information and owner information of the data elements; coding the information data corresponding to the data elements to obtain coded information data, wherein the length of the coded information data is a preset length; encrypting information data corresponding to the data elements to obtain a digital signature; issuing a binderless non-homogeneous token corresponding to a data element in one or more blockchains, the binderless non-homogeneous token comprising: encoded information data and a digital signature. The unbound NFT is enabled to carry semantic information of data elements. The content expression efficiency is improved, the dimensionality reduction representation of the information data is realized, and the size integrity of the data block and the friendliness of network transmission are considered. The independence of the unbound NFT and the block chain is ensured. The self-verification and the authenticity identification are realized, and the application is wider.

Description

Method for generating and analyzing bindless heterogeneous token and storage medium
Technical Field
The application relates to the technical field of block chains, in particular to a generation method and an analysis method of a binderless non-homogeneous token and a storage medium.
Background
With the development of technology, the application of non-binding non-homogeneous tokens (NFTs) without binding of objects under the chain is becoming more and more widespread.
An unbound NFT typically has a randomly generated string as its name, and its semantic information is associated in a blockchain.
However, such an unbundling NFT relies on a specific blockchain to obtain semantic information thereof, so that the unbundling NFT does not achieve complete decentralization.
Disclosure of Invention
The technical problem mainly solved by the application is that the unbound NFT can acquire semantic information thereof only depending on a specific blockchain, so that the unbound NFT does not realize complete decentralization.
According to a first aspect, there is provided in one embodiment a method of generating a binderless non-homogeneous token, comprising:
acquiring information data corresponding to the data elements, wherein the information data corresponding to the data elements comprises: name information and owner information of the data elements;
encoding the information data corresponding to the data elements to obtain encoded information data, wherein the length of the encoded information data is a preset length;
encrypting the information data corresponding to the data elements to obtain a digital signature;
issuing, in one or more blockchains, a binderless non-homogeneous token corresponding to the data element, the binderless non-homogeneous token including: the encoded information data and the digital signature.
Optionally, the information data corresponding to the data element further includes: routable identifying prefix information for publishing the binderless non-homogeneous token corresponding to the data element to a target node in the blockchain based on a named addressing indication.
Optionally, the information data corresponding to the data element further includes: time information and/or description information, wherein the time information comprises: generating at least one of time information, modification time information, and expiration information; the description information is used to indicate attribute information of the data element.
Optionally, the encoding the information data corresponding to the data element to obtain encoded information data includes:
respectively encoding each piece of information in the information data corresponding to the data element to obtain each piece of encoded information in the information data corresponding to the data element;
and obtaining the coded information data according to the coded information.
Optionally, before the encoding of the information data corresponding to the data element is performed to obtain the encoded information data, the method further includes:
acquiring a dictionary and/or a coding algorithm;
the encoding the information data corresponding to the data element to obtain encoded information data includes:
and coding the information data corresponding to the data elements based on the dictionary and/or the coding algorithm to obtain coded information data.
Optionally, the category of the data element includes a created category or a common category; the information data corresponding to the data elements further comprises: category identification information, the category identification information including: creating a category identifier or a common category identifier; wherein, the information data corresponding to the data elements of the creation category further comprises: a dictionary;
the obtaining dictionary and/or coding algorithm comprises:
acquiring a bindless non-homogeneous token corresponding to a data element of a target creation category, wherein information data corresponding to the data element of the target creation category further comprises: the dictionary;
the encoding the information data corresponding to the data element to obtain encoded information data includes:
and coding the information data corresponding to the data elements based on the dictionary to obtain coded information data.
Optionally, the obtaining of the unbound non-homogeneous token corresponding to the data element of the target creation category includes:
and receiving the unbound and heterogeneous token corresponding to the data element of the target created category from the block link, wherein the unbound and heterogeneous token corresponding to the data element of the target created category further comprises at least one of a letter set library, a word set library, a name set library, a geographic position set library, a time identification library, a network address set library and an identity identification set library.
According to a second aspect, an embodiment provides a method of parsing a bindless non-homogeneous token, comprising:
receiving an unbound non-homogeneous token in a blockchain, the unbound non-homogeneous token including therein: the information processing method includes the steps of encoding information data and a digital signature, wherein the encoded information data are obtained by encoding information data corresponding to data elements, and the information data corresponding to the data elements comprise: name information and owner information of the data elements; the digital signature is obtained by encrypting the information data corresponding to the data elements;
verifying the signature in the unbound heterogeneous token to obtain a verification result, wherein the verification result comprises passing verification or failing verification;
and under the condition that the verification result is that the verification is passed, decoding the unbound heterogeneous token to obtain information data corresponding to the data element.
According to a third aspect, there is provided in one embodiment a method of generating a binderless non-homogeneous token, comprising:
acquiring information data and a dictionary corresponding to the data elements, wherein the information data corresponding to the data elements comprises: name information and owner information of the data elements;
encoding the information data corresponding to the data elements to obtain encoded information data, wherein the length of the encoded information data is a preset length;
encrypting the information data corresponding to the data elements to obtain a digital signature;
issuing unbound non-homogeneous token tokens corresponding to the data elements in one or more block chains, so that after nodes in the block chains acquire unbound non-homogeneous token tokens corresponding to the data elements, encoding information data corresponding to data elements of a common type based on the dictionary to generate unbound non-homogeneous token tokens corresponding to data elements of the common type; included in the bindless non-homogeneous token are: the encoded information data, the dictionary, and the digital signature.
According to a fourth aspect, an embodiment provides a computer readable storage medium having a program stored thereon, the program being executable by a processor to implement a method as described in any of the first, second or third aspects above.
According to the generation method and the analysis method of the unbound non-homogeneous token and the storage medium of the embodiment, the information data is encoded by acquiring the information data corresponding to the data element, and the unbound NFT carries the encoding of the semantic information of the data element, so that the unbound NFT carries the semantic information of the data element, and the data of the uplink in the block chain cannot be too long. In addition, the unbound NFT carries semantic information of data elements and does not need to be bound with a specific block chain, so that the unbound NFT can be published in a plurality of block chains, and the independence of the unbound NFT data and the block chains is ensured. Furthermore, the unbound NFT contains a digital signature, so that the self-verification and authenticity identification of the NFT data block are realized. The application of the unbound NFT is wider.
Drawings
Fig. 1 is a schematic flow chart of a method for generating a binderless non-homogeneous token according to an embodiment of the present application;
figure 2 is a schematic flow chart of another method for generating bindless non-homogeneous tokens according to an embodiment of the present application;
FIG. 3 is a flow chart illustrating a method for resolving binderless heterogeneous tokens according to an embodiment of the present disclosure;
figure 4 is a schematic flow diagram of another method of generating unbound heterogeneous tokens provided herein;
fig. 5 is a diagram of a logical architecture of a metasystem provided in the present application.
Detailed Description
The present application will be described in further detail below with reference to the accompanying drawings by way of specific embodiments. Wherein like elements in different embodiments are numbered with like associated elements. In the following description, numerous details are set forth in order to provide a better understanding of the present application. However, those skilled in the art will readily recognize that some of the features may be omitted or replaced with other elements, materials, methods in different instances. In some instances, certain operations related to the present application have not been shown or described in detail in order to avoid obscuring the core of the present application from excessive description, and it is not necessary for those skilled in the art to describe these operations in detail, so that they may be fully understood from the description in the specification and the general knowledge in the art.
Furthermore, the features, operations, or characteristics described in the specification may be combined in any suitable manner to form various embodiments. Also, the various steps or actions in the method descriptions may be transposed or transposed in order, as will be apparent to one of ordinary skill in the art. Thus, the various sequences in the specification and drawings are for the purpose of describing certain embodiments only and are not intended to imply a required sequence unless otherwise indicated where such sequence must be followed.
Definitions of terms used in the present application are described below
Homogeneous tokens (FT) can replace, and approach, unlimited resolution tokens (tokens) to each other. For example, a bitcoin owned by user a is essentially indistinguishable from a bitcoin owned by user B.
NFT is a unit of data on a chain of blocks (digital book) called, and each token may represent a unique digital element, such as digital material or digital assets. Because they are not interchangeable, NFTs may represent digital files such as paintings, sounds, films, in-game items, or other forms of creative works.
Unbundling NFT means that all information of a token exists only on a blockchain (herein simply referred to as a chain), and no other down-chain assets (information) are associated with the token on the chain.
Unbound NFTs have a wide range of applications, e.g., can be used for domain names, such as DNS management application scenarios; the method can be used for application scenarios such as identification-to-binary numerical ID association of network resources, network virtual resources (such as computational power networks) and network devices (unmanned aerial vehicles, terminals, robots and sensors); can be used to build new search engines; can be used in the construction of distributed business and other scenes.
An application scenario of unbound NFT is described as follows: the meta universe. The main core of the meta universe is the load bearing of virtual assets and virtual identities, which requires the creation of a fair, open source, reliable, economic system. By means of the block chain, the safety of the virtual assets and the virtual identities of the users can be guaranteed, the value exchange in the metasphere is realized, and the whole circulation system is executed in a transparent mode, so that the metasphere can be constructed by means of the block chain. The meta universe needs to be combined with the value elements brought by the encryption technology: NFT. The Yuan universe must be economically active to really operate. In the context of a blockchain value economy, because the FT transaction medium can be continuously replicated without scarcity, it cannot provide an anchor value. The NFT perfectly solves the problem as a non-homogeneous token, each NFT is unique corresponding to a certain real thing, a user has digital ownership, and a value anchor based on the scarcity of the value is used for carrying out transaction, so that the metastasizing is operated.
An existing unbound NFT is described below. Root is an unbound NFT on the etherhouse chain. The lot NFT is randomly generated equipment and stored on the blockchain, statistics, images and other functions are omitted, and explained by others.
Although the number of the local, CryptoKitties, etc. is called as unbounded NFT, it can only operate based on the ethernet protocol platform, and in a certain sense, it is also bound to the block chain of a specific block chain in a one-to-one association manner, and is not absolutely decoupled. The association of the unique chain still forms the logic centralization, and in the aspect of safety, the risk of single point failure exists, and the absolute safety of any absolute block chain and all data blocks on the block chain in the strict sense cannot be ensured.
In the embodiment of the application, the unbounded NFT carries the encoding of the semantic information of the data element, so that the unbounded NFT carries the semantic information of the data element, and the data of the uplink in the blockchain cannot be too long, by encoding the semantic information of the data element, the data length of each unbounded NFT is as small as possible, and the requirement of the data size in the blockchain is met.
The following will explain details of the present invention by specific examples.
The first embodiment is as follows:
referring to fig. 1, fig. 1 is a schematic flow chart of a method for generating a non-binding non-homogeneous token according to an embodiment of the present disclosure, where the method of this embodiment may be applied to a block chain, and the method of this embodiment may be executed by a computer, a smart phone, a tablet device, and the like, and may be a node device in the block chain. The method of the embodiment may include the steps of:
s101: and acquiring information data corresponding to the data elements.
The information data corresponding to the data element may include, but is not limited to: name information and owner information of the data elements.
The information data corresponding to the data elements is semantic information corresponding to the data elements. The information data corresponding to the data elements may include a plurality of types, for example, name information is one type, owner information is one type, and the like. One for each field. Each field may have a value length set so that the value corresponding to the unbound NFT may form a binary value for the communication transmission.
The name information of the data elements may also be referred to as identity information of the data elements, and a unique identifier of the NFT is generated for each data element, where each data element is in one-to-one correspondence with the name information.
The owner information is information of an owner of the data element, and may be identification information of the owner of the data element, name information of the owner of the data element, or the like, which is not limited in this application.
For example, the name information may be represented by a one-hot (one-hot) coding mode or a Distributed Representation (Distributed Representation) coding mode, so as to implement uniqueness of the unbound NFT, which is not limited in this application.
Optionally, the information data corresponding to the data element may further include: routable identifying prefix information.
Wherein the routable identifying prefix information is used to publish the bindless non-homogeneous token corresponding to the data element to a target node in the blockchain based on the named addressing indication.
In a network in which the blockchain employs named addressing, routable identification prefix information may point to a target node in the blockchain by name, so as to send an unbounded NFT corresponding to the data element to the target node. The block chain system may adopt a system architecture of an Intelligent Eco network (IEN for short). Accordingly, the unbound NFT in the embodiments of the present application may also be referred to as IENNFT.
Optionally, the information data corresponding to the data element may further include: time information.
Wherein the time information is used for information indicating a time associated with the data element. The time information may include, but is not limited to: at least one of time information, modification time information, and expiration information is generated.
The time information may also form a one-to-one identifier of the unbound NFT together with the name information, or may be recorded as function-required date information.
Illustratively, the granularity of the time information record may be time, minute or second, and may also be day. Due to the binary values of the name information and the owner information described above, the addressing space is large enough in named addressing, and therefore, time information can be stored in units of days.
For example, the time information may be in one or more forms, for example, the time information may be recorded as: start date-end date.
Optionally, the information data corresponding to the data element may further include: information is described.
Wherein the description information is used to indicate attribute information of the data element. The description information is used to describe the attribute attached to the data element.
Illustratively, delimiters, such as "/", may be included in the description information to constitute a hierarchy.
Optionally, the information data corresponding to the data element may further include: and expanding the information.
The extension information may be used to store some of the information not mentioned above.
S102: and coding the information data corresponding to the data elements to obtain coded information data.
The information data corresponding to the data elements are semantic information, and in order to facilitate network transmission, the information data corresponding to the data elements need to be encoded, and then converted into binary codes for network transmission.
The length of the encoded information data is a preset length.
The preset length is a preset length, and may be 24 bytes, for example.
Illustratively, the name information of a data element may be represented by a binary 64-bit value, i.e., a binary 64-bit number (8 bytes, 18446744073709551616=1844 trillion 6744 trillion 0737 billion …); the name information of the data element may be 128 bit.
Illustratively, the owner information for a data element may include a 6-byte value (48 th power 281474976710656 of 2, 281 trillion). It is also possible to supplement 2 bytes on a 6-byte basis, or string escape values of several bytes.
For example, the routable identification prefix information may be in a digital form or a character form, and if the routable identification prefix information is in the character form, the routable identification prefix information may be transcoded into a numerical form and then converted into a binary system. The length of routable identifying prefix information can be represented by 64 bits, i.e. a binary 64-bit number (8 bytes), wherein the middle can also contain a separator, e.g. "/", thereby constituting a hierarchy of named addressing; or may be changed to 128 bits (16 bytes) as needed.
Optionally, after the information is converted into binary code, if the set field code length is not sufficient, the bit may be complemented by "0".
In one possible implementation, all data in the information data corresponding to the data element may be encoded. That is, information data corresponding to the data elements is encoded as a whole.
In another possible implementation manner, each piece of information in the information data corresponding to the data element may be encoded, respectively, to obtain each piece of encoded information in the information data corresponding to the data element. And obtaining the coded information data according to the coded information.
I.e. different fields are encoded separately and converted into binary values, thereby facilitating network transmission.
S103: and encrypting the information data corresponding to the data elements to obtain the digital signature.
In order to ensure the safety of the information data corresponding to the data elements, the information data corresponding to the data elements is encrypted to obtain a digital signature corresponding to the information data.
S104: unbounded non-homogeneous tokens corresponding to the data elements are issued in one or more blockchains.
Wherein the unbound heterogeneous token comprises: encoded information data and a digital signature.
The encoded information data and the digital signature together can constitute a unbound type NFT corresponding to the data element, thereby generating a unbound type NFT corresponding to the data element.
Since the unbound NFT is not generated in dependence on a particular blockchain, the unbound NFT may be published in one or more blockchains.
In this embodiment, information data corresponding to a data element is obtained, the information data is encoded, and encoding of semantic information of the data element is carried in a non-binding NFT, so that the non-binding NFT carries the semantic information of the data element, and data linked in a block chain cannot be too long. In addition, the unbound NFT carries semantic information of data elements and does not need to be bound with a specific block chain, so that the unbound NFT can be published in a plurality of block chains, and the independence of the unbound NFT data and the block chains is ensured. Furthermore, the unbound NFT contains a digital signature, so that the self-verification and authenticity identification of the NFT data block are realized. The application of the unbound NFT is wider.
On the basis of the above embodiment, there are many ways in which the character string in S102 needs to be converted into binary code, and before the encoding processing in S102, the encoding method needs to be acquired first and then S102 needs to be executed. The embodiment shown in FIG. 2 will be described in detail below.
Referring to fig. 2, fig. 2 is a schematic flow chart of another method for generating an unbound heterogeneous token according to an embodiment of the present application, and fig. 2 is based on the embodiment shown in fig. 1, and further, before S102, the method may further include the following step S201:
s201: a dictionary and/or encoding algorithm is obtained.
In this embodiment, the dictionary may be obtained, the encoding algorithm may also be obtained, and the dictionary and the encoding algorithm may also be obtained simultaneously.
The dictionary may also be referred to as a dictionary, and the dictionary includes codes corresponding to words and/or vocabularies forming semantic information, so that after information data is converted into codes, the coded information data is the codes in the dictionary, and when the coded information data is decoded, the corresponding information data can be obtained through the dictionary according to the coding. The dictionary may be selected or customized.
For example, in the application scenario of the metasma, the set of all words of the metasma digital space, i.e. the total number of words, can be determined by selecting a dictionary. The dictionary may serve as the infrastructure for the metasystem to generate an unbound NFT.
By way of example, the largest chinese dictionary printing plates in the world today are: chinese big dictionary (13 volume, 2.27 thousand single words and 37.5 thousand compound words), Taiwan Chinese big dictionary (10 volume, 4.99 thousand single words and 37 thousand compound words). The English oxford high-order English-Chinese double-solution dictionary contains 8 ten thousand words. The second edition published in 1989 of the oxford english dictionary included 301,100 main words. The common english word is 3-4 ten thousand. The English vocabulary is 40-60 ten thousand in total. Generally, about 120 ten thousand entries can completely complete 'inverted index' to complete a Chinese dictionary + an English dictionary which covers relatively comprehensive vocabulary. That is, binary 3 bytes (2 ^24=16, 777, 216, 167 tens of thousands) values can complete the index representation.
Further, the dictionary may contain the sequence numbers/index values of the words (sets) representing the vocabulary and the order of the vocabulary. In the process of converting the information data into the binary codes, the codes store the serial numbers/index values corresponding to the information data, and the coded information data is a binary value array. For example, each byte in the binary value array of the encoded information data represents a serial number, and if the array is 128 bytes at most, 128 semantic words are stored in the array, that is, one byte records one word, so that the space is saved, and the length of the unbound NFT is compressed.
Further, if there is a newly added word, the original dictionary may be updated, or a dictionary including the newly added word may be issued.
The encoding algorithm is an algorithm for encoding a character string, and may be an encoding name or the algorithm itself. For example, an encoding system such as American Standard Code for Information exchange (ASCII) or Unicode may be used.
For example, for single character to binary encoding. A character coding mode is determined, and characters (English letters, Chinese characters and the like) can be converted into binary values. After the adopted binary code is determined, the number of bytes, namely the preset length, can be determined from the length.
For example, English characters may be encoded in ASCII, and a character requires 1byte in length.
For example, 8-bit (Universal Character Set/Unicode Transformation Format, UTF-8 for short) encoding can be used. UTF-8 encoding is one of the most widely used implementations of Unicode over the internet. UTF-8 is a variable length coding scheme. It can use 1-4 bytes (to ensure maximum compatibility, maximum 4 bytes are used to reserve storage space) to represent a symbol, and the byte length is changed according to different symbols.
For example, Chinese may be encoded using "GB 2312". Each chinese character occupies two bytes (2 bytes). 6763 Chinese characters are recorded and recorded in the GB2312 standard; GB2312 also includes 682 full-size characters including latin letters, greek letters, japanese hiragana and katakana letters, russian cyrillic letters.
Binary encoding is converted for multiple and/or non-semantic character strings. The maximum string size may be determined first, for example if a field consists of up to 8 english characters, ASCII code (1 byte/letter) may be used. It can be concluded that all such strings can be represented by binary values of up to 8 bytes (fixed length).
Further, the encoding algorithm may also be a filter, for example, a reversible bloom filter or a reversible cuckoo filter. The method comprises the steps of encoding a non-binding type NFT expression vector by using a reversible bloom filter or a reversible cuckoo filter, and compressing semantic string information to binary codes (hash values), so as to realize the unification of the length of the non-binding type NFT, for example, in order to reduce the collision rate, the length of the reversible bloom filter can be a multiple of more than 2 of the binary codes, so that information data are further compressed, and the size of the non-binding type NFT is reduced.
Further, the coding algorithm may also adopt a Principal Component Analysis (PCA) technique, and may perform dimensionality reduction on information data, thereby improving the capacity and expansibility of the unbundled NFT, and improving the performance efficiency of similarity determination.
Further, the encoding algorithm may also be an auto-encoder. An autoencoder is a deep artificial network that is able to learn to efficiently represent data (called encoding) without supervision. The method can be used for dimension reduction, feature extraction, unsupervised pre-training and model generation, so that the coding algorithm is a trained coder model. The depth auto-encoder may encode the high-dimensional data into a low-dimensional data. Further, the low-dimensional data is reconstructed into the original high-dimensional data using a decoder. The encoder and the decoder can be used for compressing and/or decompressing information data in the unbound NFT, so that the capacity and the expansibility of the unbound NFT are improved, and the performance efficiency of similarity judgment is improved.
Further, the encoding algorithm may also be a compression algorithm. For example, after a dictionary is selected/formulated, the dictionary is used to encode the data information, and then the compression algorithm is used to compress the data information. The compression algorithm can be lossless compression, LZW coding compression technology, Huffman coding and the like.
In this embodiment, based on the block chain, a trusted, unique, high-density (unbounded NFT with semantic content), low-redundancy, and high-performance data dimension reduction mapping method is provided. Complex unstructured digital content, such as: AR/VR, video, picture and audio are further encoded into binary representation after text semantization, so that efficient compression and calculation are realized, and resource requirements, network bandwidth requirements and complexity of calculation processing are greatly reduced. Furthermore, the method can be applied to the fields of symbolic dimension reduction representation, digital processing and wider metastic space construction.
Accordingly, S102 may be performed by the following step S1021:
s1021: and coding the information data corresponding to the data elements based on the dictionary and/or the coding algorithm to obtain coded information data.
In a possible implementation manner, a dictionary may be acquired, so that the information data corresponding to the data element is encoded based on the acquired dictionary to obtain encoded information data.
In another possible implementation manner, a coding algorithm may also be acquired, so that the information data corresponding to the data element is coded based on the acquired coding algorithm to obtain coded information data.
In another possible implementation manner, the dictionary and the encoding algorithm may also be acquired at the same time, so that the information data corresponding to the data elements is encoded based on the acquired dictionary and encoding algorithm to obtain encoded information data.
For example, the encoding process may be performed based on a dictionary, and dictionary-encoded information data may be obtained. And coding the information data coded by the dictionary based on a coding algorithm to obtain the coded information data.
In this embodiment, by acquiring the dictionary and/or the coding algorithm, the information data is coded by the acquired dictionary and/or coding algorithm, so as to obtain the coded information data, so that the information data of the unbound NFT is in a form favorable for network transmission, compression of the data is realized, and propagation of the unbound NFT in a block chain is facilitated. In addition, the unbound NFT is based on a unified dictionary and/or coding algorithm, so that after the node acquires the unbound NFT, the unbound NFT can be decoded based on the dictionary and/or coding algorithm to obtain information data corresponding to the data element.
In some embodiments, in step S104, the unbundled NFT may be published in one or more blockchains, and if published in a plurality of blockchains, the case of cross-chain communication is involved, which is described in detail in the following with specific embodiments.
On the basis of the above embodiment, further, if publishing in multiple blockchains, before publishing in a target blockchain, the method further includes: authorization of the target blockchain is obtained. Cross-link communication requires authorization of the target blockchain before communication can begin after authorization.
Wherein the authorization may include, but is not limited to: accounting book data authorization and contract message authorization.
After the ledger data is authorized, the target block chain can directly access the related data of the source block chain through the cross-chain service, such as a block header, a complete block and/or a transaction.
After the contract message is authorized, the source block chain can send the message to the intelligent contract of the target block chain through the cross-chain service, and the intelligent contract of the target chain completes the processing of the message.
The method of the bindless heterogeneous token of the present embodiment is described below by taking a digital element as an example of a photograph.
Referring to table 1, table 1 shows the contents of a bindless heterogeneous token provided by the present application.
TABLE 1 contents of unbound heterogeneous tokens
Words in unbound NFT Segment of Original text content
1. Category identification field 00000001
2. Name information field One rare photograph: 1. the name "rabbit on Mars"; 2. the picture format is as follows: jpg; 3. the picture size is as follows: 10M; 4. picture frame Hash fingerprint value of
3. Owner information field The user's last name is "T-number (T-1)", the globally unique ID value is: 1024. individual attribute is 'machine' and electronic mail box Is "T-1 @ aaaaaa. com"
4. Routable prefix letter Message field Chinese/Shenzhen/images/Sciences/Space
5. Time field 10.1.10.2021 or Oct.1st, 2021
6. Description information field Pictures taken on mars: a lovely white rabbit-like creature with six legs was found on the Martian planet, which is a very popular form of a disease Is the first evidence of life habitation environment outside the earth
7. Extended information field Issue a declaration: "this unbound NFT belongs to the national security bureau and is first created on site a and is not transferable
8. Signature field 128 Bytes
In the category identification field, "00000000" may be defined to indicate the creation category (i.e., general category/public category), and 00000001 may be defined to indicate the general category.
The routable prefix information field may be in a URI format, for example, to indicate an affiliation hierarchy of the unbound NFT.
The description information field may be a segment of words composed of phrases, and may specify that a phrase contains at most 32 words.
The extended information field may be an additional information text field for being extended.
The signature field may be specified to be of a fixed length, and may be determined according to a cryptographic algorithm, for example, 1024-bit or 2048-bit public key encryption.
The content information of the pictures in table 1 is binary-coded, thereby generating an unbounded NFT.
Example two
The nodes in the blockchain may implement the process of generating and publishing the unbound NFT as in embodiment one above. In some scenarios, after receiving the unbounded NFT generated in the manner of the first embodiment, a node in the block chain may perform decoding processing on the unbounded NFT, so as to obtain semantic information of the unbounded NFT. The embodiment shown in FIG. 3 will be described in detail below.
Referring to fig. 3, fig. 3 is a flowchart illustrating an analysis method for a binderless non-homogeneous token provided in this embodiment of the present application, where the method of this embodiment may be applied to a block chain, and the method of this embodiment may be executed by a computer, a smart phone, a tablet device, or the like, and may be a node device in the block chain, for example, the node device may also be executed to execute the method of the first embodiment. The method of the embodiment comprises the following steps:
s301: an unbound non-homogeneous token is received in a blockchain.
Wherein the unbound heterogeneous token comprises: encoded information data and a digital signature.
The encoded information data is obtained by encoding information data corresponding to the data elements, and the information data corresponding to the data elements includes: name information and owner information of the data elements; the digital signature is obtained by encrypting information data corresponding to the data element.
The unbound NFT may be generated and published in the blockchain in the manner of embodiment one above.
S302: and verifying the signature in the unbound non-homogeneous token to obtain a verification result.
Wherein, the verification result comprises that the verification is passed or not passed.
S303: and under the condition that the verification result is that the verification is passed, decoding the unbound heterogeneous token to obtain information data corresponding to the data elements.
After receiving the unbound NFT, a node in the block chain first verifies the digital signature of the unbound NFT to determine the authenticity of the unbound NFT. If the verification fails, the unbound NFT may not be processed. If the verification is passed, the encoded information data can be decoded, so as to obtain the information data corresponding to the data element.
The decoding process and the encoding process in the unbounded NFT generation are reciprocal processes.
In this embodiment, information data corresponding to a data element is obtained by receiving an unbound non-homogeneous token in a block chain, and the encoded information data is decoded to carry out encoding of semantic information of the data element in an unbound NFT, so that the semantic information of the data element is carried in the unbound NFT, and the data of the uplink in the block chain cannot be too long. In addition, the unbound NFT carries semantic information of data elements and does not need to be bound with a specific block chain, so that the unbound NFT can be published in a plurality of block chains, and the independence of the unbound NFT data and the block chains is ensured. And moreover, the unbound NFT contains a digital signature, so that self-verification and authenticity identification of the data block of the unbound NFT are realized. The application of the unbound NFT is wider.
In some other embodiments, the information data corresponding to the data elements further includes: routable identifying prefix information.
Wherein the routable identifying prefix information is used to publish the bindless non-homogeneous token corresponding to the data element to a target node in the blockchain based on the named addressing indication. The routable id prefix information is similar to the routable id prefix information in the first embodiment, and is not described here again.
In some other embodiments, the information data corresponding to the data elements further includes: time information.
Wherein the time information includes: at least one of time information, modification time information, and expiration information is generated. The time information is similar to the time information in the first embodiment, and is not described herein again.
In some other embodiments, the information data corresponding to the data elements further includes: information is described.
Wherein the description information is used to indicate attribute information of the data element. The description information is similar to the description information in the first embodiment, and is not described herein again.
In another embodiment, the encoded information data is obtained by encoding each piece of information in the information data corresponding to the data element to obtain each piece of encoded information in the information data corresponding to the data element, and obtaining the encoded information according to each piece of encoded information.
In other embodiments, the encoded information data is obtained by performing encoding processing based on the obtained dictionary and/or encoding algorithm. Before S303, the following step a may be further included:
step a: a dictionary and/or decoding algorithm is obtained.
Accordingly, S303 may be implemented by:
and under the condition that the verification result is that the verification is passed, decoding the unbound heterogeneous token based on a dictionary and/or a decoding algorithm to obtain information data corresponding to the data elements.
The obtained dictionary is the same as the dictionary used in the encoding, and similarly, the decoding algorithm corresponds to the encoding algorithm used in the encoding and is the inverse process.
It is to be understood that the method provided in the second embodiment may be executed by any node in the block chain, may be executed alone, or may be executed in combination with the method in the first embodiment.
When the method in the first embodiment is executed in combination, the execution of S301 to S303 and the execution of S101 to S104 are not in sequence, and S301 to S303 may be executed first, and then S101 to S104 may be executed; or S101-S104 can be executed first, and then S301-S303 can be executed; S301-S303 and S101-S104 can also be executed simultaneously, and the execution sequence is not limited in the application.
EXAMPLE III
In some scenarios, a data element including the encoding method used in the unbounded NFT generation process may be issued in a block chain by a node having authority based on a protocol, and thus, the data element may be used as an "infrastructure" in the unbounded NFT construction process, and this type of data element is referred to as an created NFT in this application. The creation class NFT will be described in detail below with reference to an example shown in fig. 4.
Referring to fig. 4, fig. 4 is a flow chart illustrating another method for generating a bindless non-homogeneous token according to the present application. The categories of the data elements include a created category or a common category; wherein, the information data corresponding to the data elements of the creation category further comprises: a dictionary. This embodiment is performed by a node in the blockchain that has the right to issue the foundational class NFT accordingly. The generation manner of the unbounded NFT corresponding to the data elements of the general category is similar to the method of the first embodiment. The method of the embodiment comprises the following steps:
s401: and acquiring information data and a dictionary corresponding to the data elements.
Wherein, the information data corresponding to the data element comprises: name information and owner information of the data elements.
The name information of the data elements in this embodiment is similar to the name information of the data elements in the first embodiment, and is not repeated here.
The owner information in this embodiment is similar to the owner information in the first embodiment, and the owner information in this embodiment corresponds to the data element having the release creation category.
S402: and coding the information data corresponding to the data elements to obtain coded information data, wherein the length of the coded information data is a preset length.
S403: and encrypting the information data corresponding to the data elements to obtain the digital signature.
S404: and issuing unbound and non-homogeneous token tokens corresponding to the data elements in one or more block chains, so that after nodes in the block chains acquire unbound and non-homogeneous token tokens corresponding to the data elements, encoding information data corresponding to the data elements of the common type based on a dictionary to generate unbound and non-homogeneous token tokens corresponding to the data elements of the common type.
Wherein the unbound heterogeneous token comprises: encoded information data, dictionaries, and digital signatures.
In this embodiment, the node with authority may be, for example, a creator, a highest authority, or a node with authority of the system, and the dictionary is published in the blockchain in the form of an unbounded non-homogeneous token of a creation category, so that after the node in the blockchain acquires the unbounded non-homogeneous token corresponding to the data element, the information data corresponding to the data element of the common type is encoded based on the dictionary, and the unbounded non-homogeneous token corresponding to the data element of the common type is generated. The construction of the infrastructure of the unbound heterogeneous token is realized, the information data can be coded based on the dictionary in the unbound type NFT of the created category, so that the information data is compressed, the unbound type NFT can carry semantic information of data elements, the length of each unbound type NFT is as small as possible, the requirement on the size of the data in a block chain is met, the content expression efficiency of the data is improved, the dimensionality reduction representation of the information data is realized, and the spread in the block chain is facilitated. The size integrity of the unbound NFT data block and the friendliness of network transmission are both considered, that is, the performance efficiency is also considered. In addition, the unbound NFT does not need to be bound with a specific block chain because the unbound NFT carries semantic information of data elements, so that the unbound NFT can be issued in a plurality of block chains, and the independence of the unbound NFT data and the block chains is ensured. Furthermore, the unbound NFT contains a digital signature, so that the self-verification and authenticity identification of the NFT data block are realized. The application of the unbound NFT is wider.
In some embodiments, the information data corresponding to the data elements further includes: category identification information.
The category identification information may include: a created category identification or a generic category identification. The created category identifier is used for indicating that the category of the unbound type NFT is a created category, and the common category identifier is used for indicating that the category of the unbound type NFT is a common category.
Therefore, when the node device in the block chain acquires an unbounded NFT, the type of the unbounded NFT may be determined based on the type identification information included therein.
In the protocol design, a field of category identification information is added in the unbound type NFT, so that unbound type NFTs generated aiming at different categories of data elements can be generated by using the same protocol, and the formulation and execution of the protocol are facilitated.
In some embodiments, the unbound heterogeneous token corresponding to the data element of the created category may further include at least one of a letter set library, a word set library, a name set library, a geographic location set library, a time identifier library, a network address set library, and an identity set library.
Wherein the alphabet collection library is used to indicate a collection of alphabets that the bindless heterogeneous token corresponding to a general category of data elements may contain.
Wherein the library of word sets indicates a set of words that the bindless heterogeneous token corresponding to a common category of data elements may contain.
Wherein the name collection library is used for indicating the collection of the names of the nodes which need to be issued by the bindless heterogeneous token corresponding to the data elements of the creating category.
The geographic location aggregation library is used for indicating aggregation of geographic locations of nodes which are required to be issued by the bindless heterogeneous token corresponding to the data elements of the creating category.
Wherein the time identification library is used for indicating time information which the unbound heterogeneous token corresponding to the data elements of the common category needs to contain.
The network address set library is used for indicating a set of network addresses of nodes which are required to be issued by the unbound heterogeneous token corresponding to the data elements of the creating category.
The identity set library is used for indicating the set of identities of the nodes which need to be issued by the unbound heterogeneous token corresponding to the data elements of the creating category.
In some embodiments, the founder type NFT may also contain coding algorithms and then uplink.
The verification tools disclosed throughout the network by issuing corresponding NFT-based verification programs on blockchains, for example: the web service interface is used for determining a verification method, so that each node in different block chains can independently analyze, generate and verify the semantic content of the unbound NFT conveniently. Therefore, the consistency in the all-digital space is ensured by adopting the same verification process and calculation method.
It is to be understood that the method provided in the third embodiment may be executed by a node in the blockchain that has a right to issue the creating category unbound NFT, alone, or in combination with the methods in the first and/or second embodiments.
When the method in the first embodiment is executed in combination, the execution of S401-S404 and S101-S104 has no sequence, and S401-S404 may be executed first, and then S101-S104 may be executed; or S101-S104 can be executed first, and then S401-S404 can be executed; S401-S404 and S101-S104 can also be executed simultaneously, and the execution sequence is not limited in the application.
In some scenarios, when the method of this embodiment is combined with the embodiment, after a node having an issuing authority of an initial class unbound NFT issues an unbound NFT of a corresponding initial class according to the method of the third embodiment, the node in the block chain may store the initial class unbound NFT locally, or, when it is necessary to issue an ordinary class unbound NFT, obtain the initial class unbound NFT in the block chain. The following will explain details of the present invention by specific examples.
On the basis of the first embodiment, further, the step S201 can be implemented by the following step S2011:
s2011: and acquiring unbound non-homogeneous tokens corresponding to the data elements of the target creature category.
Wherein, the information data corresponding to the data elements of the target creation category further comprises: a dictionary.
Accordingly, S1021 may be implemented by:
and coding the information data corresponding to the data elements based on the dictionary to obtain coded information data.
Further, S2011 may be implemented by:
and receiving the unbound and heterogeneous token corresponding to the data element of the target created category from the block link, wherein the unbound and heterogeneous token corresponding to the data element of the target created category further comprises at least one of a letter set library, a word set library, a name set library, a geographic position set library, a time identification library, a network address set library and an identity identification set library.
In some scenarios, when the method of this embodiment is combined with embodiment two, after a node having an issuing authority of an initial class unbound NFT issues an unbound NFT of a corresponding initial class according to the method of embodiment three, the node in the block chain may store the initial class unbound NFT locally, or, when the ordinary class unbound NFT needs to be decoded, obtain the initial class unbound NFT in the block chain. The following will explain details of the present invention by specific examples.
On the basis of the second embodiment, further, the step a can be realized by the following steps:
and acquiring unbound non-homogeneous tokens corresponding to the data elements of the target creature category.
Wherein, the information data corresponding to the data elements of the target creation category further comprises: a dictionary.
Accordingly, S303 may be implemented by:
and under the condition that the verification result is that the verification is passed, decoding the unbound heterogeneous token based on the dictionary to obtain information data corresponding to the data elements.
Further, step a may be implemented by:
and receiving unbound non-homogeneous tokens corresponding to the data elements of the target creation category from the blockchain.
The unbound heterogeneous token corresponding to the data elements of the target creation category further comprises at least one of a letter set library, a word set library, a name set library, a geographic location set library, a time identifier library, a network address set library and an identity identifier set library.
Example four:
the above embodiment is described in detail with reference to the example of fig. 5.
Referring to fig. 5, fig. 5 is a diagram of a logical architecture of a system in the metasphere provided by the present application, where the metasphere includes a blockchain 51, a blockchain 52, and a blockchain 53. Data interaction between block chains can be realized through cross-chain authorization. In the third embodiment, an unbounded NFT of the created type is published in the blockchain a, the blockchain B, and the blockchain C, and the unbounded NFT of the created type includes a dictionary repository 54 (corresponding to the dictionary in the above embodiment), so that the nodes in the blockchain implement encoding of an unbounded NFT of a general type based on the dictionary repository 54 and publish the unbounded NFT in a plurality of blockchains. When a node receives the ordinary type of unbound NFT, the ordinary type of unbound NFT is verified based on the reverse verification toolset 55, and then the ordinary type of unbound NFT is decoded based on the dictionary.
Example five:
embodiments of the present application provide a computer-readable storage medium, on which a program is stored, where the program can be executed by a processor to implement the method according to any one of the first embodiment, the second embodiment, or the third embodiment.
Those skilled in the art will appreciate that all or part of the functions of the various methods in the above embodiments may be implemented by hardware, or may be implemented by computer programs. When all or part of the functions of the above embodiments are implemented by a computer program, the program may be stored in a computer-readable storage medium, and the storage medium may include: a read only memory, a random access memory, a magnetic disk, an optical disk, a hard disk, etc., and the program is executed by a computer to realize the above functions. For example, the program may be stored in a memory of the device, and when the program in the memory is executed by the processor, all or part of the functions described above may be implemented. In addition, when all or part of the functions in the above embodiments are implemented by a computer program, the program may be stored in a storage medium such as a server, another computer, a magnetic disk, an optical disk, a flash disk, or a removable hard disk, and may be downloaded or copied to a memory of a local device, or may be version-updated in a system of the local device, and when the program in the memory is executed by a processor, all or part of the functions in the above embodiments may be implemented.
The present application has been described with reference to specific examples, which are provided only to aid understanding of the present application and are not intended to limit the present application. For a person skilled in the art to which the application pertains, several simple deductions, modifications or substitutions may be made according to the idea of the application.

Claims (10)

1. A method of generating a binderless non-homogeneous token, comprising:
acquiring information data corresponding to the data elements, wherein the information data corresponding to the data elements comprises: name information and owner information of the data elements;
encoding the information data corresponding to the data elements to obtain encoded information data, wherein the length of the encoded information data is a preset length;
encrypting the information data corresponding to the data elements to obtain a digital signature;
issuing, in one or more blockchains, a binderless non-homogeneous token corresponding to the data element, the binderless non-homogeneous token including: the encoded information data and the digital signature.
2. The method of claim 1, wherein the information data corresponding to the data element further comprises: routable identifying prefix information for publishing the binderless non-homogeneous token corresponding to the data element to a target node in the blockchain based on a named addressing indication.
3. The method of claim 1, wherein the information data corresponding to the data element further comprises: time information and/or description information, wherein the time information comprises: generating at least one of time information, modification time information, and expiration information; the description information is used to indicate attribute information of the data element.
4. The method according to any one of claims 1 to 3, wherein said encoding information data corresponding to the data element to obtain encoded information data comprises:
respectively encoding each piece of information in the information data corresponding to the data element to obtain each piece of encoded information in the information data corresponding to the data element;
and obtaining the coded information data according to the coded information.
5. The method according to any one of claims 1 to 3, wherein before the encoding of the information data corresponding to the data element to obtain the encoded information data, the method further comprises:
acquiring a dictionary and/or a coding algorithm;
the encoding the information data corresponding to the data element to obtain encoded information data includes:
and coding the information data corresponding to the data elements based on the dictionary and/or the coding algorithm to obtain coded information data.
6. The method of claim 5, wherein the categories of data elements include a created category or a common category; the information data corresponding to the data elements further comprises: category identification information, the category identification information including: creating a category identifier or a common category identifier; wherein, the information data corresponding to the data elements of the creation category further comprises: a dictionary;
the obtaining dictionary and/or coding algorithm comprises:
acquiring a bindless non-homogeneous token corresponding to a data element of a target creation category, wherein information data corresponding to the data element of the target creation category further comprises: the dictionary;
the encoding the information data corresponding to the data element to obtain encoded information data includes:
and coding the information data corresponding to the data elements based on the dictionary to obtain coded information data.
7. The method of claim 6, wherein said obtaining unbound non-homogenous tokens corresponding to data elements of a target foundational category comprises:
and receiving the unbound and heterogeneous token corresponding to the data element of the target created category from the block link, wherein the unbound and heterogeneous token corresponding to the data element of the target created category further comprises at least one of a letter set library, a word set library, a name set library, a geographic position set library, a time identification library, a network address set library and an identity identification set library.
8. A method for parsing unbound non-homogeneous tokens, comprising:
receiving an unbound non-homogeneous token in a blockchain, the unbound non-homogeneous token including therein: the information processing method includes the steps of encoding information data and a digital signature, wherein the encoded information data are obtained by encoding information data corresponding to data elements, and the information data corresponding to the data elements comprise: name information and owner information of the data elements; the digital signature is obtained by encrypting the information data corresponding to the data elements;
verifying the signature in the unbound heterogeneous token to obtain a verification result, wherein the verification result comprises passing verification or failing verification;
and under the condition that the verification result is that the verification is passed, decoding the unbound heterogeneous token to obtain information data corresponding to the data element.
9. A method of generating a binderless non-homogeneous token, comprising:
acquiring information data and a dictionary corresponding to the data elements, wherein the information data corresponding to the data elements comprises: name information and owner information of the data elements;
encoding the information data corresponding to the data elements to obtain encoded information data, wherein the length of the encoded information data is a preset length;
encrypting the information data corresponding to the data elements to obtain a digital signature;
issuing unbound non-homogeneous token tokens corresponding to the data elements in one or more block chains, so that after nodes in the block chains acquire unbound non-homogeneous token tokens corresponding to the data elements, encoding information data corresponding to data elements of a common type based on the dictionary to generate unbound non-homogeneous token tokens corresponding to data elements of the common type; included in the bindless non-homogeneous token are: the encoded information data, the dictionary, and the digital signature.
10. A computer-readable storage medium, characterized in that the medium has stored thereon a program which is executable by a processor to implement the method according to any one of claims 1-9.
CN202210040269.7A 2022-01-14 2022-01-14 Method for generating and analyzing bindless heterogeneous token and storage medium Active CN114065269B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210040269.7A CN114065269B (en) 2022-01-14 2022-01-14 Method for generating and analyzing bindless heterogeneous token and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210040269.7A CN114065269B (en) 2022-01-14 2022-01-14 Method for generating and analyzing bindless heterogeneous token and storage medium

Publications (2)

Publication Number Publication Date
CN114065269A true CN114065269A (en) 2022-02-18
CN114065269B CN114065269B (en) 2022-04-12

Family

ID=80230866

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210040269.7A Active CN114065269B (en) 2022-01-14 2022-01-14 Method for generating and analyzing bindless heterogeneous token and storage medium

Country Status (1)

Country Link
CN (1) CN114065269B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115170322A (en) * 2022-09-05 2022-10-11 深圳市明源云科技有限公司 Real estate property right transfer method, device, terminal device and computer medium

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180186855A1 (en) * 2016-03-23 2018-07-05 Alector Llc Chimeric receptors and methods of use thereof
CA3118593A1 (en) * 2018-11-02 2020-05-07 Verona Holdings Sezc A tokenization platform
JP6710401B1 (en) * 2019-12-05 2020-06-17 bacoor dApps株式会社 Method and management server for managing object
US20200213121A1 (en) * 2018-12-28 2020-07-02 Leona HIOKI Token management system and token management method
CN112035875A (en) * 2020-08-28 2020-12-04 江苏恒为信息科技有限公司 Method for realizing native non-homogeneous assets
US20210133713A1 (en) * 2019-10-30 2021-05-06 Skychain Co., Ltd. Asset right management system based on blockchain and method thereof
CN113112262A (en) * 2021-04-30 2021-07-13 支付宝(杭州)信息技术有限公司 Digital asset transfer method corresponding to intellectual property
US11075891B1 (en) * 2020-12-02 2021-07-27 Theta Labs, Inc. Non-fungible token (NFT) based digital rights management in a decentralized data delivery network
CN113327168A (en) * 2021-06-30 2021-08-31 杭州链网科技有限公司 Method and system for generating and transferring non-homogeneous digital currency
CN113362073A (en) * 2020-03-06 2021-09-07 上海部恩科技有限公司 Virtual asset disposal method based on block chain non-homogenization evidence
CN113396388A (en) * 2018-12-07 2021-09-14 耐克创新有限合伙公司 System and method for providing encrypted secure digital assets

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180186855A1 (en) * 2016-03-23 2018-07-05 Alector Llc Chimeric receptors and methods of use thereof
CA3118593A1 (en) * 2018-11-02 2020-05-07 Verona Holdings Sezc A tokenization platform
US20210248594A1 (en) * 2018-11-02 2021-08-12 Verona Holdings Sezc Tokenization platform
US20210326852A1 (en) * 2018-11-02 2021-10-21 Verona Holdings Sezc Tokenization platform
CN113396388A (en) * 2018-12-07 2021-09-14 耐克创新有限合伙公司 System and method for providing encrypted secure digital assets
US20200213121A1 (en) * 2018-12-28 2020-07-02 Leona HIOKI Token management system and token management method
US20210133713A1 (en) * 2019-10-30 2021-05-06 Skychain Co., Ltd. Asset right management system based on blockchain and method thereof
JP6710401B1 (en) * 2019-12-05 2020-06-17 bacoor dApps株式会社 Method and management server for managing object
CN113362073A (en) * 2020-03-06 2021-09-07 上海部恩科技有限公司 Virtual asset disposal method based on block chain non-homogenization evidence
CN112035875A (en) * 2020-08-28 2020-12-04 江苏恒为信息科技有限公司 Method for realizing native non-homogeneous assets
US11075891B1 (en) * 2020-12-02 2021-07-27 Theta Labs, Inc. Non-fungible token (NFT) based digital rights management in a decentralized data delivery network
CN113112262A (en) * 2021-04-30 2021-07-13 支付宝(杭州)信息技术有限公司 Digital asset transfer method corresponding to intellectual property
CN113327168A (en) * 2021-06-30 2021-08-31 杭州链网科技有限公司 Method and system for generating and transferring non-homogeneous digital currency

Non-Patent Citations (10)

* Cited by examiner, † Cited by third party
Title
1级小能手: "Loot:一个无绑定型nft的诞生", <HTTPS://WEIBO.COM/TTARTICLE/P/SHOW?ID=2309404682786295644512> *
MIKKO VINNARI: "Potential Use Cases for Nonfungible Tokens in Combination with Physical Art", 《OPINNÄYTETYÖ TOUKOKUU 2021》 *
NIKITA KARANDIKAR: "Blockchain Based Transaction System with Fungible and Non-Fungible Tokens for a Community-Based Energy Infrastructure", 《HTTPS://DOI.ORG/10.3390/S21113822》 *
ONE数…: "17个非同质化代币(NFT)最常见问题汇总", 《HTTPS://ZHUANLAN.ZHIHU.COM/P/406733019》 *
QIN WANG: "Non-Fungible Token (NFT): Overview,Evaluation, Opportunities and Challenges (Tech ReportV2)", 《CRYPTOGRAPHY AND SECURITY》 *
SUBHASH SHANKAR PANDEY: "Realizing non-fungible token (NFT) through IBM quantum experience", 《HTTPS://WWW.RESEARCHGATE.NET/PUBLICATION/355203845》 *
WILLIAM ENTRIKEN: "EIP-721: Non-Fungible Token Standard", 《HTTPS://GITHUB.COM/ETHEREUM/EIPS/ISSUES/721》 *
程念胜: "一种基于令牌的单点登录认证服务", 《计算机应用》 *
苏宇: "区块链治理的政府责任", 《法商研究》 *
鲜枣课堂: ""元宇宙"火了,这玩意到底是啥?", 《HTTPS://ZHUANLAN.ZHIHU.COM/P/396134310》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115170322A (en) * 2022-09-05 2022-10-11 深圳市明源云科技有限公司 Real estate property right transfer method, device, terminal device and computer medium

Also Published As

Publication number Publication date
CN114065269B (en) 2022-04-12

Similar Documents

Publication Publication Date Title
Xiang et al. A linguistic steganography based on word indexing compression and candidate selection
CN1716855B (en) Call signs
Roy et al. A novel approach to format based text steganography
JP5121930B2 (en) How to provide a textual representation of cryptographic values
US11070231B2 (en) Reducing storage of blockchain metadata via dictionary-style compression
CN107947918A (en) A kind of carrier-free text steganography method based on character feature
US10681013B2 (en) Methods and systems for concealing information
CN116108506B (en) Meta-universe digital asset security management system
CN114065269B (en) Method for generating and analyzing bindless heterogeneous token and storage medium
CN113821536B (en) Data processing method, device and equipment based on block chain and readable storage medium
CN115408350A (en) Log compression method, log recovery method, log compression device, log recovery device, computer equipment and storage medium
Rafat et al. Secure digital steganography for ASCII text documents
Rahman et al. Highly Imperceptible and Reversible Text Steganography Using Invisible Character based Codeword.
CN111651417B (en) Log processing method and device
Kaushik et al. Zero-width text steganography in cybercrime attacks
Wu et al. New graph-theoretic approach to social steganography
He et al. Semi-structured data protection scheme based on robust watermarking
Majumder et al. A new text steganography method based on sudoku puzzle generation
Guan et al. A novel coverless text steganographic algorithm based on polynomial encryption
TWI499928B (en) Data hiding method via revision records on a collaboration platform
CN110231935A (en) A kind of method, apparatus, equipment and the storage medium of script execution and update
CN109033887A (en) A method of enclosing in block chain with having supervision can not tampered image
CN112989809B (en) Synonym expansion and label transfer based text carrier-free information hiding method
Wai et al. Modified linguistic steganography approach by using syntax bank and digital signature
Zheng et al. Improved lossless data hiding for JPEG images based on optimized VLC mapping

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