CN114826686B - Time-limited encryption and decryption method based on intelligent contract - Google Patents
Time-limited encryption and decryption method based on intelligent contract Download PDFInfo
- Publication number
- CN114826686B CN114826686B CN202210333324.1A CN202210333324A CN114826686B CN 114826686 B CN114826686 B CN 114826686B CN 202210333324 A CN202210333324 A CN 202210333324A CN 114826686 B CN114826686 B CN 114826686B
- Authority
- CN
- China
- Prior art keywords
- polynomial
- encryption
- unitary
- sample
- sample points
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000011084 recovery Methods 0.000 claims abstract description 3
- 230000001174 ascending effect Effects 0.000 claims description 13
- 230000001502 supplementing effect Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 5
- 238000005336 cracking Methods 0.000 description 3
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0435—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
- H04L63/068—Network architectures or network communication protocols for network security for supporting key management in a packet data network using time-dependent keys, e.g. periodically changing keys
Abstract
The invention relates to the technical field of information, in particular to a time-limited encryption and decryption method based on an intelligent contract, which comprises the following steps: issuing intelligent contracts on a block chain, wherein a public area displays m sample points; the encryption party selects a public column which accords with the time limit; the encryption party generates an integer n, and generates a unitary polynomial to pass through n sample points; calculating a sample distance; the unitary polynomial with the minimum sample distance is an encryption polynomial; the encryption party encrypts data by using an encryption polynomial to obtain a ciphertext; the decryption party obtains the related column number and the ciphertext of the time limit, judges whether the current moment exceeds the time limit, queries the block chain if the current moment does not exceed the time limit, and obtains m sample points in a public area corresponding to the column number; the unitary polynomial of n sample points is exhausted, and the unitary polynomial with the minimum sample distance is obtained as the recovery polynomial; plaintext data is obtained using a recovering polynomial decryption text. The invention has the following substantial effects: the time limit is executed more reliably, and the security of time limit encryption and decryption is improved.
Description
Technical Field
The invention relates to the technical field of information, in particular to a time-limited encryption and decryption method based on an intelligent contract.
Background
Time-limited encryption and decryption means that encrypted data can only be correctly decrypted within a predetermined time limit. If the predetermined period is exceeded, the decryption process cannot be completed even if the key is held. The time-limited encryption technology can effectively control the diffusion of data in time, improves the safety of the data, and provides a new mode for the sharing of the data. However, the current time-limited encryption and decryption algorithm is generally based on local time comparison, and the decryption time limit is easily bypassed by modifying the local time. Resulting in less secure time-limited decryption. It is necessary to study a new time-limited encryption and decryption algorithm.
Disclosure of Invention
The invention aims to solve the technical problems that: the technical problem of low encryption and decryption security at present. The time-limited encryption and decryption method based on the intelligent contract can strictly control the time-limited decryption and improve the security of time-limited encryption and decryption.
In order to solve the technical problems, the invention adopts the following technical scheme: a time-limited encryption and decryption method based on intelligent contracts comprises the following steps: the method comprises the steps that an intelligent contract is issued on a blockchain, the intelligent contract comprises a plurality of publicity columns, each publicity column comprises a column number, a residual update time length and a publicity zone, each publicity zone displays m sample points (xi, yi), i epsilon [1, m ], when the residual update time length is 0, the sample points in the publicity zone are updated and the residual update time length is reset to be an initial value; the encryption party selects a public column with the remaining updating time length consistent with the time limit, reads a column number and m sample points; the encryption party generates an integer n, n < m, and generates a unitary polynomial, wherein the unitary polynomial passes through n sample points in m sample points; calculating the distances between the remaining m-n sample points and the unitary polynomial, and recording the sum of the distances as a sample distance; the unitary polynomials of n sample points in m sample points are exhausted, the sample distance of each unitary polynomial is calculated respectively, and the unitary polynomial with the minimum sample distance is the encryption polynomial; the encryption party encrypts data by using an encryption polynomial to obtain a ciphertext, and completes the encryption process by numbering and time limiting of a ciphertext association column; after obtaining the related column number and the ciphertext of the time limit, the decryption party judges whether the current moment exceeds the time limit, if yes, the decryption party does not operate, if not, the decryption party inquires the intelligent contract on the blockchain, and m sample points in the public area corresponding to the column number are obtained; the unitary polynomials of n sample points in m sample points are exhausted, and the unitary polynomial with the minimum sample distance is obtained as the recovery polynomial; plaintext data is obtained using a recovering polynomial decryption text.
Preferably, the encryption party encrypts data by using a symmetric encryption algorithm to obtain a ciphertext, wherein an encryption Key of the symmetric encryption algorithm is Key; encrypting the Key by using an encryption polynomial, and associating the encrypted Key, column number and time limit with the ciphertext to complete the encryption process; the decryption party queries the blockchain within a time limit to obtain a restoration polynomial, and uses the restoration polynomial to decrypt the Key; and decrypting the ciphertext by using the decrypted Key to obtain plaintext data.
Preferably, the method of encrypting data using an encryption polynomial includes: converting the data into binary stream, supplementing bits according to a preset rule, cutting off the binary stream into a plurality of binary numbers with fixed lengths, and marking the values of the binary numbers as B; generating a data combination (B1, x1, B2, x2, …, bN, xN, Δ) such that b= Σ (-1) ≡f (xi) +Δ, i e [1, n ], - Δ is a correction value; the data corresponding to all binary numbers are combined to form the ciphertext.
Preferably, the encryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distances; selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence; the encryption process is completed by the cipher text association column number, the sequence number s and the time limit; reading sample points of a column number corresponding to a public column in a time limit by a decryption party; the decryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distances; and obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial.
Preferably, after the encryption party obtains m sample points in the public column, randomly generating sample points (x 0, y 0), wherein the sample points (x 0, y 0) and the m sample points in the public column form a sample set, and the sample set contains m+1 sample points in total; the encryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance; selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence; completing the encryption process by using the cipher text association column number, the serial number s, the sample point (x 0, y 0) and the time limit; the decrypting side reads sample points of the column numbers corresponding to the publicizing columns in a time limit, and adds the sample points (x 0, y 0) to obtain a restored sample set; the decryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance; and obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial.
The invention has the following substantial effects: the time limit encryption and decryption process is completed through the intelligent contract on the block chain, so that the time limit is more reliably executed, and the situation that the time limit is invalid due to the fact that the time limit judgment is bypassed by modifying the local time is avoided; the efficiency of time-limited encryption and decryption is improved through an improved encryption algorithm; the additional sample points are used to improve the cracking difficulty of time-limited encryption and decryption, and further improve the security of time-limited encryption and decryption.
Drawings
FIG. 1 is a schematic diagram of a time-limited encryption and decryption method according to an embodiment.
Fig. 2 is a schematic diagram of an indirect encryption method according to an embodiment.
FIG. 3 is a diagram of a method for encrypting data using an encryption polynomial according to an embodiment.
Fig. 4 is a schematic diagram of a binary encryption unit polynomial acquisition method according to an embodiment.
Fig. 5 is a schematic diagram of a binary encryption unit polynomial acquisition method according to an embodiment.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings.
Embodiment one:
referring to fig. 1, the time-limited encryption and decryption method based on the intelligent contract includes: step A01) issuing an intelligent contract on a blockchain, wherein the intelligent contract comprises a plurality of public columns, each public column comprises a column number, a residual update time length and a public zone, each public zone displays m sample points (xi, yi), i E [1, m ], and when the residual update time length is 0, the sample points in the public zone are updated and the residual update time length is reset to be an initial value; step A02), the encryption party selects a public column with the remaining updating time length consistent with the time limit, and reads the number of the column and m sample points; step A03), the encryption party generates an integer n, n < m, and generates a unitary polynomial, wherein the unitary polynomial passes through n of m sample points; step A04), calculating the distances between the remaining m-n sample points and the unitary polynomial, and recording the sum of the distances as a sample distance; step A05), the unitary polynomials of n sample points in m sample points are exhausted, the sample distance of each unitary polynomial is calculated respectively, and the unitary polynomial with the minimum sample distance is the encryption polynomial; step A06) the encryption party encrypts data by using an encryption polynomial to obtain a ciphertext, and the ciphertext is associated with a column number and a time limit to complete the encryption process; step A07), after obtaining the cipher text of the association column number and the time limit, the decryption party judges whether the current moment exceeds the time limit, if yes, the decryption party does not operate, if not, the decryption party queries the intelligent contract on the block chain, and m sample points in the public area corresponding to the column number are obtained; step A08) exhausting the unitary polynomials of n sample points in the m sample points, and obtaining the unitary polynomial with the minimum sample distance as a restoring polynomial; step a 09) obtains plaintext data using a recovering polynomial decryption key. As shown in table 1, 60 publicity columns are recorded in the table, and each publicity column has a remaining update time length, so that 60 time-limited time lengths can be provided.
TABLE 1 Smart contract Contents Table
| Publicity column 1 | { column number 1, remaining update time length 1, public zone 1} |
| Bulletin board 2 | { column number 2, remaining update time length 2, publicity area 2} |
| Publicity column 3 | { column number 3, remaining update time length 3, publicity area 3} |
| … | … |
| Bulletin board 60 | { column number 60, remaining update time length 60, publicity area 60} |
The number of sample points described in the display area of the display column 2 is 4, and the sample points are respectively: (2, 16), (4, 24), (8, 36) and (12,64), i.e., m=4, when n takes a value of 2, the unitary polynomial of 2 sample points out of 4 sample points is shown in table 2. The unitary polynomial y=5x+4 where the sample distance is the smallest is taken as the encryption polynomial.
Table 2, 2 n =2, unitary polynomial and sample distance table
| Sequence number | Unitary polynomial | Sample distance |
| 1 | y=4x+8 | 12 |
| 2 | 3y=10x+28 | 16 |
| 3 | y=4.8x+6.4 | 10.4 |
| 4 | y=3x+12 | 18 |
| 5 | y=5x+4 | 10 |
| 6 | y=7x+-20 | 38 |
When the data volume is larger, the intelligent contract needs longer time to finish the encryption and decryption process, and the encryption and decryption efficiency is affected. For this purpose, the present embodiment provides a corresponding solution, please refer to fig. 2, including: step B01), the encryption party encrypts data by using a symmetric encryption algorithm to obtain a ciphertext, wherein an encryption Key of the symmetric encryption algorithm is Key; step B02) encrypting the Key by using an encryption polynomial, and associating the encrypted Key, column number and time limit with the ciphertext to complete the encryption process; step B03), the decryption party queries the blockchain within a time limit to obtain a restoring polynomial, and uses the restoring polynomial to decrypt the Key; and B04) decrypting the ciphertext by using the decrypted Key to obtain plaintext data.
Referring to fig. 3, the method for encrypting data using an encryption polynomial includes: step C01) converting the data into binary stream, supplementing bits according to a preset rule, and then cutting off the binary stream into a plurality of binary numbers with fixed lengths, wherein the value of the binary number is marked as B; step C02) generating a data combination (B1, x1, B2, x2, …, bN, xN,) such that B= Σ (-1) ≡f (xi) +Δ, i e [1, N ],. DELTA.is a correction value; step C03), combining the data corresponding to all binary numbers to form the ciphertext. If Key is "EuWk", under ASCII coding, converting the character string EuWk into binary system: 01000101 01110101 01010111 01101011, cut into two integers according to a length of 2 bytes, d1= 17781 and d2= 22379, respectively. The unitary polynomial f (x) is: f (x) =15 x 2-32 x+64. D1 can be expressed as d1=f (17) +f (31) +439, and the corresponding data combination is (0,17,0,31,439). The data combination of the integer D2 can be obtained in the same way. The data combination for each integer is non-unique.
In order to improve the encryption and decryption efficiency by using the unitary polynomial f (x), the information source generates an independent variable x value set for each encryption column; the information source calculates the function value of the current encryption function under the value set of the independent variable x, and the function value is associated with the value of the independent variable x to be used as a quick lookup table; when the information source encrypts the Key Key22, a quick look-up table is queried, N function values are selected, N bi values are correspondingly generated, and the difference value between Sigma ([ 1 ]) bi ] f (xi) and D is in a preset range.
The essential effects of this embodiment are: the time limit encryption and decryption process is completed through the intelligent contract on the block chain, so that the time limit is more reliably executed, and the situation that the time limit is invalid due to the fact that the time limit judgment is bypassed by modifying the local time is avoided; the efficiency of time-limited encryption and decryption is improved through an improved encryption algorithm; the additional sample points are used to improve the cracking difficulty of time-limited encryption and decryption, and further improve the security of time-limited encryption and decryption.
Embodiment two:
in the technical solution described in the first embodiment, if the correct n value is not obtained, m unitary polynomials can be recovered through m sample points. To improve security of time-limited encryption, the bulletin board should disclose a plurality of sample points, such as 512 or 1024 sample points. However, even if the number of sample points is increased, the ciphertext Key is easily broken by an exhaustive attempt. The present example thus provides a specific implementation to avoid the problem of the cryptographic polynomial being vulnerable to exhaustive attacks. Referring to fig. 4, the method includes: step D01), the encryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in an ascending order according to the sample distances; step D02) selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence; step D03), completing the encryption process by using the ciphertext association column number, the sequence number s and the time limit; step D04), the decrypting party reads sample points of the column numbers corresponding to the public columns in a time limit; step D05), the decryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in an ascending order according to the sample distances; step D06) obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial. For the publicized area m=6 sample points, a total of 64 possible univariate polynomials can be generated. When the public area discloses 1024 sample points, 2-1024 unitary polynomials can be generated, the number is extremely large, and the difficulty of exhaustive cracking is remarkably improved.
Embodiment III:
in order to improve the security of time-limited encryption and decryption against exhaustive attack, the embodiment provides a new technical scheme based on the first embodiment. Referring to fig. 5, the present embodiment includes: step E01), after the encryption party obtains m sample points of the public column, randomly generating sample points (x 0, y 0), wherein the sample points (x 0, y 0) and the m sample points of the public column form a sample set, and the sample set totally comprises m+1 sample points; step E02) the encryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance; step E03), selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence; e04) completing the encryption process by using the ciphertext association column number, the sequence number s, the sample point (x 0, y 0) and the time limit; step E05), the decrypting side reads sample points of the column numbers corresponding to the publicizing columns in a time limit, and adds the sample points (x 0, y 0) to obtain a restored sample set; step E06) the decryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance; step E07) obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial.
The number of sample points described in the display area of the display column 2 is 4, and the sample points are respectively: (2, 16), (4, 24), (8, 36) and (12,64), the encryptor randomly generates sample points (x0=6, y0=30) to increase the sample points to 5, and n still takes a value of 2, so that a unitary polynomial of 2 sample points is exhausted to 10, as shown in table 3.
Table 3 unitary polynomial and sample distance table with sample points added and n=2
| Sequence number | Unitary polynomial | Sample distance |
| 1 | y=4x+8 | 14 |
| 2 | y=10/3x+28/3 | 16.7 |
| 3 | y=4.8x+6.4 | 15.6 |
| 4 | y=3.5x+9 | 15 |
| 5 | y=3x+12 | 18 |
| 6 | y=5x+4 | 14 |
| 7 | y=3x+12 | 18 |
| 8 | y=7x-20 | 46 |
| 9 | y=3x+12 | 18 |
| 10 | y=17/3x-4 | 19.3 |
The sample distances of the 1 st and 6 th unitary polynomials are the same, and the two polynomials are arranged in ascending order according to the highest order term coefficient, so as to obtain an encryption polynomial of y=4x+8. By adding one sample point, the exhaustive univariate polynomial and corresponding sample point distances are changed. If the added sample points are absent, the encryption polynomial cannot be deduced according to the sample points disclosed in the public region, so that the encryption polynomial cannot be cracked through exhaustive attack theoretically, and the security of the time-limited encryption algorithm is effectively improved.
The above-described embodiment is only a preferred embodiment of the present invention, and is not limited in any way, and other variations and modifications may be made without departing from the technical aspects set forth in the claims.
Claims (5)
1. The time-limited encryption and decryption method based on the intelligent contract is characterized by comprising the following steps of:
the method comprises the steps that an intelligent contract is issued on a blockchain, the intelligent contract comprises a plurality of publicity columns, each publicity column comprises a column number, a residual update time length and a publicity zone, each publicity zone displays m sample points (xi, yi), i epsilon [1, m ], when the residual update time length is 0, the sample points in the publicity zone are updated and the residual update time length is reset to be an initial value;
the encryption party selects a public column with the remaining updating time length consistent with the time limit, reads a column number and m sample points;
the encryption party generates an integer n, n < m, and generates a unitary polynomial, wherein the unitary polynomial passes through n sample points in m sample points;
the method comprises the steps of (1) exhausting a unitary polynomial of n sample points in m sample points, calculating distances between the remaining m-n sample points and the unitary polynomial, recording the sum of the distances as a sample distance, and respectively calculating the sample distance of each unitary polynomial, wherein the unitary polynomial with the minimum sample distance is an encryption polynomial;
the encryption party encrypts data by using an encryption polynomial to obtain a ciphertext, and completes the encryption process by numbering and time limiting of a ciphertext association column;
after obtaining the related column number and the ciphertext of the time limit, the decryption party judges whether the current moment exceeds the time limit, if yes, the decryption party does not operate, if not, the decryption party inquires the intelligent contract on the blockchain, and m sample points in the public area corresponding to the column number are obtained;
the unitary polynomials of n sample points in m sample points are exhausted, and the unitary polynomial with the minimum sample distance is obtained as the recovery polynomial;
plaintext data is obtained using a recovering polynomial decryption text.
2. The smart contract-based time-limited encryption and decryption method as set forth in claim 1, wherein,
the encryption party encrypts data by using a symmetric encryption algorithm to obtain a ciphertext, wherein an encryption Key of the symmetric encryption algorithm is Key;
encrypting the Key by using an encryption polynomial, and associating the encrypted Key, column number and time limit with the ciphertext to complete the encryption process;
the decryption party queries the blockchain within a time limit to obtain a restoration polynomial, and uses the restoration polynomial to decrypt the Key;
and decrypting the ciphertext by using the decrypted Key to obtain plaintext data.
3. The smart contract-based time-limited encryption and decryption method as set forth in claim 1, wherein,
the method for encrypting data using an encryption polynomial includes:
converting the data into binary stream, supplementing bits according to a preset rule, cutting off the binary stream into a plurality of binary numbers with fixed lengths, and marking the values of the binary numbers as B;
generating a data combination (B1, x1, B2, x2, …, bN, xN, Δ) such that b= Σ (-1) ≡f (xi) +Δ, i e [1, n ], - Δ is a correction value;
the data corresponding to all binary numbers are combined to form the ciphertext.
4. A smart contract-based time-limited encryption and decryption method as claimed in claim 1 to 3, characterized in that,
the encryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distances;
selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence;
the encryption process is completed by the cipher text association column number, the sequence number s and the time limit;
reading sample points of a column number corresponding to a public column in a time limit by a decryption party;
the decryption party exhausts the unitary polynomials of n sample points in the m sample points, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distances;
and obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial.
5. A smart contract-based time-limited encryption and decryption method as claimed in claim 1 to 3, characterized in that,
after the encryption party obtains m sample points of the public column, randomly generating sample points (x 0, y 0), wherein the sample points (x 0, y 0) and the m sample points of the public column form a sample set, and the sample set contains m+1 sample points;
the encryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance;
selecting one of the unitary polynomials as an encryption polynomial, and recording the sequence number s of the encryption polynomial in the sequence;
completing the encryption process by using the cipher text association column number, the serial number s, the sample point (x 0, y 0) and the time limit;
the decrypting side reads sample points of the column numbers corresponding to the publicizing columns in a time limit, and adds the sample points (x 0, y 0) to obtain a restored sample set;
the decryption party exhausts the unitary polynomials of n sample points in the sample set, and after calculating the sample distance of each unitary polynomial, the unitary polynomials are arranged in ascending order according to the sample distance;
and obtaining a unitary polynomial corresponding to the sequence number s as a restoration polynomial.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210333324.1A CN114826686B (en) | 2022-03-31 | 2022-03-31 | Time-limited encryption and decryption method based on intelligent contract |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210333324.1A CN114826686B (en) | 2022-03-31 | 2022-03-31 | Time-limited encryption and decryption method based on intelligent contract |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114826686A CN114826686A (en) | 2022-07-29 |
| CN114826686B true CN114826686B (en) | 2024-04-05 |
Family
ID=82533371
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210333324.1A Active CN114826686B (en) | 2022-03-31 | 2022-03-31 | Time-limited encryption and decryption method based on intelligent contract |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114826686B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231404A (en) * | 2020-10-15 | 2021-01-15 | 深圳壹账通智能科技有限公司 | Block chain-based data sharing method, computer device and storage medium |
| WO2021184975A1 (en) * | 2020-03-18 | 2021-09-23 | 支付宝(杭州)信息技术有限公司 | Off-chain privacy calculation method and apparatus for on-chain data |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3718069B1 (en) * | 2017-11-30 | 2024-04-17 | Visa International Service Association | Blockchain system for confidential and anonymous smart contracts |
| US11595515B2 (en) * | 2019-09-30 | 2023-02-28 | Ringcentral, Inc. | System and method of caller verification |
-
2022
- 2022-03-31 CN CN202210333324.1A patent/CN114826686B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021184975A1 (en) * | 2020-03-18 | 2021-09-23 | 支付宝(杭州)信息技术有限公司 | Off-chain privacy calculation method and apparatus for on-chain data |
| CN112231404A (en) * | 2020-10-15 | 2021-01-15 | 深圳壹账通智能科技有限公司 | Block chain-based data sharing method, computer device and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| 云计算服务中的区块链技术研究;李嘉兴;中国博士学位论文全文数据库 (信息科技辑);I138-4 * |
| 基于区块链的车联网安全通信技术研究;黎北河;中国优秀硕士学位论文全文数据库 (工程科技Ⅱ辑);20200215;C034-498 * |
| 基于双重加密的敏感数据限时访问研究;陈伟;王D;秦志光;刘鑫忠;;电子科技大学学报(第03期);第588-593页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114826686A (en) | 2022-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102136904B1 (en) | Shared secret key generation device, encryption device, decryption device, shared secret key generation method, encryption method, decryption method, and program | |
| US6891950B1 (en) | Extended key generator, encryption/decryption unit, extended key generation method, and storage medium | |
| CN101461173B (en) | Method of homonymous substation symmetric encryption | |
| US20100239087A1 (en) | Encrypting variable-length passwords to yield fixed-length encrypted passwords | |
| CN110299989B (en) | Encryption and decryption method for Chinese and English character strings | |
| EP1609065A1 (en) | Cascading key encryption | |
| CN102402670A (en) | File encryption and decryption method | |
| CA2754268A1 (en) | Split key secure access system | |
| CN104811298A (en) | Method and device for realizing encryption | |
| Tunga et al. | A new modified Playfair algorithm based on frequency analysis | |
| CN114826590B (en) | Packet mode encryption method, packet mode decryption method, packet mode encryption device, packet mode decryption device and packet mode decryption equipment | |
| Xiang et al. | An improved chaotic cryptosystem with external key | |
| CN114826686B (en) | Time-limited encryption and decryption method based on intelligent contract | |
| CN114757789A (en) | Insurance claim settlement system based on block chain | |
| CN109743305A (en) | The method for realizing applicating text data protection in the application of Intelligent dialogue system | |
| WO2002054664A2 (en) | R-conversion encryption method and system | |
| Vance | VAES3 scheme for FFX: An addendum to The FFX mode of operation for Format Preserving Encryption | |
| CN114826558A (en) | Mass data rapid encryption method and system | |
| CN112668042B (en) | File encryption method | |
| JP2002510058A (en) | Method for cryptographic conversion of binary data blocks | |
| CN110581759A (en) | UOEC-HEX symmetric encryption algorithm | |
| CN114785571B (en) | Subscription information distribution system based on block chain | |
| KR102123586B1 (en) | One-time encryption method using random matrix with uniform distribution | |
| EP4117221A1 (en) | Method for performing cryptographic operations in a processing device, corresponding processing device and computer program product | |
| CN114785516B (en) | Time-limited encryption and decryption system based on block chain |
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 |