Two-stage blind signature countable hidden trace query method
Through two-level blind signature technology, data encryption and counting and billing are realized in anonymous query, which solves the problem of difficulty in measuring and billing of the queried party in the existing technology, and ensures data security and billing implementation.
Patent Information
- Application Number
- CN202410905650.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-08
- Publication Date
- 2024-11-26
AI Technical Summary
When ensuring the security of the data query party, the existing anonymous query algorithm ignores the measurement and billing of the query party, resulting in difficulties in data billing and settlement, affecting the commercial process.
Using a two-level blind signature countable anonymous query method, encrypting the server data through a key-derived algorithm, and using blind signature technology during the query process, double blinding operations between the client and the server are performed to determine the index and decrypt the query results, and record the number of query times at the same time to realize the counting and billing of the server.
It ensures the security of data during transmission, and realizes server-side counting and billing based on anonymous query, solves the problem of billing difficulties, and is of great commercial significance.
Smart Images

Figure CN119026161A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data security technology, and in particular to a two-level blind signature countable anonymous query method. Background Art
[0002] With the rapid development of big data technology, more and more individuals and companies are involved in the process of data collection and utilization. With the introduction and implementation of the "Data Security Law", "Cybersecurity Law" and "Personal Information Protection Law", data cannot be directly bought and sold. Many business scenarios such as three-factor verification and label query require the introduction of third-party data to strengthen user information verification. However, since the data itself often contains sensitive information of users, how to protect user privacy when processing data has become an urgent issue.
[0003] The anonymous query algorithm currently used in production is to ensure the security of the data query party. Since the data service party provides matching query results but cannot know which specific query object it corresponds to, and the query party does not synchronize the query results to the data queried party. The existing solution only considers the query data security of the query party, but ignores the metering and billing of the queried party, resulting in the inability to bill and settle data for the data query party in actual applications, which greatly hinders business negotiations and data metering and billing in actual commercial use.
[0004] In view of the above problems, a two-level blind signature countable anonymous query method is proposed. Summary of the invention
[0005] The purpose of this section is to summarize some aspects of embodiments of the present invention and briefly introduce some preferred embodiments. Some simplifications or omissions may be made in this section and the specification abstract and the invention title of this application to avoid blurring the purpose of this section, the specification abstract and the invention title, and such simplifications or omissions cannot be used to limit the scope of the present invention.
[0006] The present invention has been proposed in view of the above-mentioned problems.
[0007] In order to solve the above technical problems, the present invention provides the following technical solutions: a two-level blind signature countable anonymous query method, comprising the following steps:
[0008] S1, data preprocessing: encrypt the server data through the key derivation algorithm and send the encrypted data set to the client;
[0009] S2, locate index: the client decrypts and matches the query index through blinding and the blind signature of the server to determine whether the index exists on the server;
[0010] S3, decryption count: The client blinds again and obtains the blind signature of the server, decrypts to obtain the query result, and the server records the number of queries.
[0011] As a preferred solution of the two-level blind signature countable anonymous query method of the present invention, each data on the server side consists of two parts, including an index id and label data DATA.
[0012] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, the S1 specifically includes the following steps:
[0013] S11: The server generates two service keys sk 1 and sk 2 , encrypt all index fields and label fields through the key derivation algorithm, using sk 1 Generate index key id k i 1 , using sk 2 Generate data key id k i 2 , and encrypt index a again using the index key and data key respectively i and data b i , and concatenate to get c i ;
[0014] S12: The encrypted data {c i}Collection sent to the client;
[0015] S13: The client receives the encrypted data.
[0016] As a preferred solution of the two-level blind signature countable anonymous query method of the present invention, the transmission method of the encrypted data and the client in S12 includes physical dedicated line, SD-wan and the Internet.
[0017] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, the S2 specifically includes:
[0018] S21: Client queries index id x Corresponding tag DATA x , send a query request;
[0019] S22: The client selects a random r 1 , and for r 1 and id x Blind the value Q x ;
[0020] S23: Send a blind request to the server and send Q x;
[0021] S24: The server will Q x Using the service key sk 1 Perform blind signature to obtain P x ;
[0022] S25: The server sends the blind signature P to the client x ;
[0023] S26: The client follows r 1 P x Deblinding, calculating the index key id Then calculate the encrypted index a x ;
[0024] S27: In the ciphertext set {c i} in the query corresponding to c x .
[0025] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, wherein the r 1 ∈[0,n-1], n represents the total number of data on the server.
[0026] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, wherein the query corresponding to c in S27 is x Specifically, the query is performed by prefix matching.
[0027] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, if c is found in the query in S27 x , then continue to S3, otherwise end this query.
[0028] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, the S3 specifically includes:
[0029] S31: The client selects a random r 2 , and for r 2 and id x Blind the value A x ;
[0030] S32: Send a blind request to the server and send A x ;
[0031] S33: The server sends A x Using the service key sk 2 Perform blind signature to obtain B x , the server count increases by 1;
[0032] S34: The server sends the blind signature B to the client x ;
[0033] S35: The client follows the 2 To B x Deblind, calculate the data key id k x 2 ;
[0034] S36:c x Separate to obtain b x , then decrypt to get the index id x Corresponding tag DATA x .
[0035] As a preferred solution of the two-stage blind signature countable anonymous query method of the present invention, wherein the r 2 ∈[0,n-1], n represents the total number of data on the server.
[0036] Beneficial effects of the present invention:
[0037] 1. In the data preprocessing stage, all indexes and labels are encrypted through key derivation methods, which can ensure the security of original data even in the presence of third-party attacks or dishonest clients.
[0038] 2. In the query stage, through the two-level blind signature method, the server can know whether the index queried by the client is hit during the first blind signature process. If it is hit, a second blind request is made. In the second blind request, the server can count and the client can decrypt the label data. On the basis of realizing anonymous query, the server counting and billing are realized, which is of great significance for the actual commercial use of products. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for describing the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative labor. Among them:
[0040] Figure 1 The system flow chart of a two-stage blind signature countable anonymous query method of the present invention.
[0041] Figure 2 This is a diagram of the application of a two-level blind signature countable anonymous query method in the financial field of the present invention.
[0042] Figure 3The present invention is a business flow chart of a two-level blind signature countable anonymous query method.
[0043] Figure 4 This is a server interface diagram of a two-level blind signature countable anonymous query method of the present invention.
[0044] Figure 5 This is a client interface diagram of a two-level blind signature countable anonymous query method of the present invention. DETAILED DESCRIPTION
[0045] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are described in detail below in conjunction with the accompanying drawings.
[0046] In the following description, many specific details are set forth to facilitate a full understanding of the present invention, but the present invention may also be implemented in other ways different from those described herein, and those skilled in the art may make similar generalizations without violating the connotation of the present invention. Therefore, the present invention is not limited to the specific embodiments disclosed below.
[0047] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The term "in one embodiment" that appears in different places in this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive with other embodiments.
[0048] Secondly, the present invention is described in detail with reference to the schematic diagram. When describing the embodiments of the present invention in detail, for the sake of convenience, the cross-sectional diagrams showing the device structure will not be partially enlarged according to the general scale, and the schematic diagrams are only examples, which should not limit the scope of protection of the present invention. In addition, in actual production, the three-dimensional dimensions of length, width and depth should be included.
[0049] Example 1
[0050] A two-level blind signature countable anonymous query method, comprising the following steps:
[0051] S1, data preprocessing: encrypt the server data through the key derivation algorithm, and send the encrypted data set to the client. Each piece of data on the server consists of two parts, including the index id and the label data DATA;
[0052] S2, locate index: The client decrypts and matches the query index through blinding and the blind signature of the server to determine whether the index exists on the server;
[0053] S3, decryption count: The client blinds again and obtains the blind signature of the server, decrypts to obtain the query result, and the server records the number of queries.
[0054] Among them, S1 specifically includes the following steps:
[0055] S11: The server generates two service keys sk 1 and sk 2 , encrypt all index fields and label fields through the key derivation algorithm, using sk 1 Generate index key id k i 1 , using sk 2 Generate data key id Encrypt index a again using the index key and data key respectively i and data b i , and concatenate to get c i ;
[0056] S12: The encrypted data {c i The encrypted data is sent to the client through physical dedicated lines, SD-WAN, and the Internet.
[0057] S13: The client receives the encrypted data.
[0058] In addition, S2 specifically includes:
[0059] S21: Client queries index id x Corresponding tag DATA x , send a query request;
[0060] S22: The client selects a random r 1 , and for r 1 and id x Blind the value Q x , r 1 ∈[0,n-1], n represents the total number of server data;
[0061] S23: Send a blind request to the server and send Q x ;
[0062] S24: The server will Q x Using the service key sk 1 Perform blind signature to obtain P x ;
[0063] S25: The server sends the blind signature P to the client x ;
[0064] S26: The client follows the 1 P x Deblinding, calculating the index key id Then calculate the encrypted index a x ;
[0065] S27: In the ciphertext set {c i} in the query corresponding to c x , query the corresponding c x Specifically, the query is performed by prefix matching. If c x , then continue to S3, otherwise end this query.
[0066] Example 2
[0067] A two-level blind signature countable anonymous query method, based on Example 1, S3 specifically includes:
[0068] S31: The client selects a random r 2 , and for r 2 and id x Blind the value A x , r 2 ∈[0,n-1], n represents the total number of server data;
[0069] S32: Send a blind request to the server and send A x ;
[0070] S33: The server sends A x Using the service key sk 2 Perform blind signature to obtain B x , the server count increases by 1;
[0071] S34: The server sends the blind signature B to the client x ;
[0072] S35: The client follows the 2 To B x Deblind and calculate the data key id
[0073] S36:c x Separate to obtain b x , then decrypt to get the index id x Corresponding tag DATA x .
[0074] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present invention may be modified or replaced by equivalents without departing from the spirit and scope of the technical solutions of the present invention, which should all be included in the scope of the claims of the present invention.
Claims
1. A two-level blind signature countable anonymous query method, It is characterized in that The following steps are involved: S1, data preprocessing: encrypt the server data through the key derivation algorithm and send the encrypted data set to the client; S2, locate index: the client decrypts and matches the query index through blinding and the blind signature of the server to determine whether the index exists on the server; S3, decryption count: The client blinds again and obtains the blind signature of the server, decrypts to obtain the query result, and the server records the number of queries.
2. According to the two-level blind signature countable anonymous query method of claim 1, Features: Each piece of data on the server consists of two parts, including the index id and the tag data DATA.
3. According to the two-stage blind signature countable anonymous query method of claim 2, It is characterized in that The S1 specifically includes the following steps: S11: The server generates two service keys sk 1 and sk 2 , encrypt all index fields and label fields through the key derivation algorithm, using sk 1 Generate index key Using sk 2 Generate data key Encrypt index a again using the index key and data key respectively i and data b i , and concatenate to get c i ; S12: The encrypted data {c i }The collection is sent to the client; S13: The client receives the encrypted data.
4. According to the two-stage blind signature countable anonymous query method of claim 3, Features: The transmission methods of the encrypted data in S12 and the client include physical dedicated lines, SD-wan and the Internet.
5. According to the two-stage blind signature countable anonymous query method of claim 3, It is characterized in that The S2 specifically includes: S21: Client queries index id x Corresponding tag DATA x , send a query request; S22: The client selects a random r 1 , and for r 1 and id x Blind the value Q x ; S23: Send a blind request to the server and send Q x ; S24: The server will Q x Using the service key sk 1 Perform blind signature to obtain P x ; S25: The server sends the blind signature P to the client x ; S26: The client follows the 1 P x Deblinding, calculating the index key Then calculate the encrypted index a x ; S27: In the ciphertext set {c i } in the query corresponding to c x .
6. A two-stage blind signature countable anonymous query method according to claim 5, Features: The r 1 ∈[0,n-1], n represents the total number of data on the server.
7. A two-stage blind signature countable anonymous query method according to claim 6, Features: The corresponding c is queried in S27 x Specifically, the query is performed by prefix matching.
8. A two-stage blind signature countable anonymous query method according to any one of claims 5 to 7, Features: If c is found in S27 x , then continue to S3, otherwise end this query.
9. A two-stage blind signature countable anonymous query method according to claim 5, It is characterized in that The S3 specifically includes: S31: The client selects a random r 2 , and for r 2 and id x Blind the value A x ; S32: Send a blind request to the server and send A x ; S33: The server sends A x Using the service key sk 2 Perform blind signature to obtain B x , the server count increases by 1; S34: The server sends the blind signature B to the client x ; S35: The client follows the 2 To B x Deblinding, calculating the data key S36:c x Separate to obtain b x , then decrypt to get the index id x Corresponding tag DATA x .
10. A two-stage blind signature countable anonymous query method according to claim 9, Features: The r 2 ∈[0,n-1], n represents the total number of data on the server.
Citation Information
Cited By
Data metering method and device, equipment, storage medium and program product
CN121193520A
