CN113094468A - OT-based multi-data-source relational graph construction and data alignment method - Google Patents
OT-based multi-data-source relational graph construction and data alignment method Download PDFInfo
- Publication number
- CN113094468A CN113094468A CN202110140005.4A CN202110140005A CN113094468A CN 113094468 A CN113094468 A CN 113094468A CN 202110140005 A CN202110140005 A CN 202110140005A CN 113094468 A CN113094468 A CN 113094468A
- Authority
- CN
- China
- Prior art keywords
- data
- card
- bank
- key
- keys
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000010276 construction Methods 0.000 title description 2
- 229910002056 binary alloy Inorganic materials 0.000 claims description 6
- 230000005540 biological transmission Effects 0.000 claims description 6
- 238000004891 communication Methods 0.000 claims description 6
- 230000004308 accommodation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to the technical field of data query, in particular to a method for constructing a multi-data-source relational graph and aligning data based on OT, which comprises the following steps: step one, inquiring key definition; step two, each party unifies the hash mode of the data to carry out unified hash processing on the user Key; step three, the inquiring party inquires the user information according to the Key, such as: cell phone number P0, adding an obfuscating cell phone number such as: p1; and step four, the inquiry direction sends inquiry broadcast to A, B, C in the data network. The method is based on the OT protocol, so that the information of the inquirer is not exposed to the data provider, and the provider does not expose additional data to the inquirer; the invention constructs the query relation graph in a data network by one-time broadcasting, then automatically completes the query in the data network one by one according to the same protocol, and finally associates different keys of different data sources to obtain the complete information of the query user.
Description
Technical Field
The invention relates to the technical field of data query, in particular to a method for establishing a multi-data-source relational graph and aligning data based on OT.
Background
Currently, each enterprise has own business-related data, and due to business characteristics, the owned data has business-related characteristics, and the data of each company is local. The query can be obstructed when the keys associated with different data sources are inconsistent, and simultaneously, inquirer information can be exposed to a data provider, such as three different data source companies: company a, a company providing online payment services, the user data includes: mobile phone number (mobile), bank card ID (bank _ card _ ID), consumption amount, consumption habit, and the like; company B, one of which is a hotel, has user identification card related accommodation information: identity card number (idno), user lodging hotel related features; company C, a company that provides bank card swiping service, and the user data characteristics are as follows: bank card ID (bank _ card _ ID), identification number (idro), card swiping time, same amount of consumption and the like; one-time association cannot be performed among the three companies exemplified above; and it becomes more complicated if there are n different types of companies in a network querying the relationship. Meanwhile, when the inquirer inquires, inquirer information is exposed to the inquired party. In view of this, a method for constructing and aligning multiple data source relational graphs based on OT implementation is provided.
Disclosure of Invention
The invention aims to provide a method for constructing a multi-data-source relational graph and aligning data based on OT so as to solve the problems in the background art.
In order to achieve the purpose, the invention provides the following technical scheme:
a method for constructing a multi-data source relational graph and aligning data based on OT implementation comprises the following steps:
step one, inquiring key definition;
step two, each party unifies the hash mode of the data to carry out unified hash processing on the user Key;
step three, the inquiring party inquires the user information according to the Key, such as: cell phone number P0, adding an obfuscating cell phone number such as: p1;
step four, the inquiry direction sends inquiry broadcast to A, B, C in the data network;
and step five, companies with data results such as company A obtain data M0 and M1, generate two pairs of public and private keys and send the two public keys to the inquiring party: puk0, puk 1;
step six, the inquiring party generates a random number, if P0 and P0 in P1 are real data, puk0 is used for encrypting the random number, otherwise puk1 sends a ciphertext to the providing party;
step seven, the provider decrypts the encrypted random numbers by using the two private keys respectively to obtain k0 and k1, converts M0 and M1 into binary systems, and performs exclusive-or on k0 and M0 and k1 and M1 to obtain e0 and e1, and returns the e0 and the e1 to the inquirer;
step eight, the inquiring party uses the real random number to carry out exclusive OR on e0 and e1, and then converts the binary system into a character string;
step nine, the inquiring party obtains return data from three ABC companies;
step ten, the inquirer can use the OT protocol to carry out the next round of iterative inquiry according to the inquiry graph pair B, C until all data providers are inquired.
As a preferred technical scheme of the invention, the specific operation of the step one is as follows: the parties define query keys that can associate users, an example of which is as follows:
mobile phone number;
idno is the identification number;
device _ id is the device number;
bank card id the bank card number.
As a preferred technical solution of the present invention, the program code of the data format example in step three is:
{"keys":{"mobiles":["P0","P1"]},"relation":["mobile","idno","device_id","bank_card_id"]}；
keys in the above definition are keys provided to the data provider for the user to be queried, one of which is true and one of which is false;
relationship refers to which keys can be associated with.
As a preferred technical solution of the present invention, the query broadcast in step four has directionality, that is, the broadcast objects are screened according to conditions, in the next iteration, a specific object is selected for broadcast, and after receiving the broadcast, the data provider A, B, C in the data network queries from its own repository whether there is such a key and data of the specified user.
As a preferred technical scheme of the invention, the query data can be divided into the following according to the situation:
the query can be made by a key provided by a supporting party, such as company a in the above example companies, and the user data M0 is obtained, where M1 is in the form of:
{"data":{"mobile":"P0","v1":"v1_value","v2":"v2_value","vn":"vn_value","bank_card_id":"bank_card_id_value"},"relation":{"from":"mobile","to":["bank_card_id"]}}；
the two structures are returned, and encryption is respectively carried out in the OT protocol;
the data comprises all attributes of the user and an associated key value;
the relationship field is used to identify which keys the company can associate between.
As a preferred technical solution of the present invention, the query data can be further divided into:
the data does not support the inquiry of the key provided by the inquirer user, such as: company B and company C, but other keys may be queried, then return:
company B returns:
{"relation":{"valid_key":["idno"]}}；
company C returns:
{"relation":{"valid_key":["bank_card_id","idno"]}}；
this return is not encrypted.
As a preferred technical scheme of the invention, the conclusion that the data can be inquired in the step nine is as follows:
1): c can use bank _ card _ id to inquire, and A has the bank _ card _ id value of inquiring user;
2): b can be queried again by using the idno returned by C after bank _ card _ id is obtained from C;
3): therefore, a query graph, namely A- > C- > B can be constructed, and all the data to be queried in the network can be obtained.
As a preferred technical solution of the present invention, the OT protocol in the step ten is an inadvertent transmission protocol, which is a two-party communication protocol capable of protecting privacy, and enables two communication parties to transmit messages in a selective obfuscation manner. Inadvertent transmission protocol is a basic protocol of cryptography that allows the recipient of a service to inadvertently obtain certain messages entered by the sender of the service, thus protecting the recipient's privacy from the sender.
Compared with the prior art, the invention has the beneficial effects that:
the method is based on the OT protocol, so that the information of the inquirer is not exposed to the data provider, and the provider does not expose additional data to the inquirer;
the invention constructs the query relation graph in a data network by one-time broadcasting, then automatically completes the query in the data network one by one according to the same protocol, and finally associates different keys of different data sources to obtain the complete information of the query user.
Drawings
FIG. 1 is a diagram showing the structural relationship between a querying party and a data network according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the following embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The technical scheme provided by the invention is as follows:
a method for constructing a multi-data source relational graph and aligning data based on OT implementation comprises the following steps:
step one, inquiring key definition;
step two, each party unifies the hash mode of the data to carry out unified hash processing on the user Key;
step three, the inquiring party inquires the user information according to the Key, such as: cell phone number P0, adding an obfuscating cell phone number such as: p1;
step four, the inquiry direction sends inquiry broadcast to A, B, C in the data network;
and step five, companies with data results such as company A obtain data M0 and M1, generate two pairs of public and private keys and send the two public keys to the inquiring party: puk0, puk 1;
step six, the inquiring party generates a random number, if P0 and P0 in P1 are real data, puk0 is used for encrypting the random number, otherwise puk1 sends a ciphertext to the providing party;
step seven, the provider decrypts the encrypted random numbers by using the two private keys respectively to obtain k0 and k1, converts M0 and M1 into binary systems, and performs exclusive-or on k0 and M0 and k1 and M1 to obtain e0 and e1, and returns the e0 and the e1 to the inquirer;
step eight, the inquiring party uses the real random number to carry out exclusive OR on e0 and e1, and then converts the binary system into a character string;
step nine, the inquiring party obtains return data from three ABC companies;
step ten, the inquirer can use the OT protocol to carry out the next round of iterative inquiry according to the inquiry graph pair B, C until all data providers are inquired.
As a preferred technical solution of this embodiment, the specific operation of step one is as follows: the parties define query keys that can associate users, an example of which is as follows:
mobile phone number;
idno is the identification number;
device _ id is the device number;
bank card id the bank card number.
As a preferred technical solution of this embodiment, the program code of the data format example in step three is:
{"keys":{"mobiles":["P0","P1"]},"relation":["mobile","idno","device_id","bank_card_id"]}；
keys in the above definition are keys provided to the data provider for the user to be queried, one of which is true and one of which is false;
relationship refers to which keys can be associated with.
As a preferred technical solution of this embodiment, the query broadcast in step four has directionality, that is, the broadcast objects are screened according to conditions, in the next iteration, a specific object is selected for broadcast, and after receiving the broadcast, the data provider A, B, C in the data network queries from its own repository whether there is such a key and data of a specified user.
As a preferred technical solution of this embodiment, the query data can be divided into:
the query can be made by a key provided by a supporting party, such as company a in the above example companies, and the user data M0 is obtained, where M1 is in the form of:
{"data":{"mobile":"P0","v1":"v1_value","v2":"v2_value","vn":"vn_value","bank_card_id":"bank_card_id_value"},"relation":{"from":"mobile","to":["bank_card_id"]}}；
the two structures are returned, and encryption is respectively carried out in the OT protocol;
the data comprises all attributes of the user and an associated key value;
the relationship field is used to identify which keys the company can associate between.
As a preferred technical solution of this embodiment, the query data can be further divided into:
the data does not support the inquiry of the key provided by the inquirer user, such as: company B and company C, but other keys may be queried, then return:
company B returns:
{"relation":{"valid_key":["idno"]}}；
company C returns:
{"relation":{"valid_key":["bank_card_id","idno"]}}；
this return is not encrypted.
As a preferred technical solution of this embodiment, the conclusion that the data can be queried in the step nine is as follows:
1): c can use bank _ card _ id to inquire, and A has the bank _ card _ id value of inquiring user;
2): b can be queried again by using the idno returned by C after bank _ card _ id is obtained from C;
3): therefore, a query graph, namely A- > C- > B can be constructed, and all the data to be queried in the network can be obtained.
As a preferred technical solution of this embodiment, the OT protocol in step ten is an inadvertent transmission protocol, which is a two-party communication protocol capable of protecting privacy, and enables two communication parties to transmit messages in a selective obfuscation manner. Inadvertent transmission protocol is a basic protocol of cryptography that allows the recipient of a service to inadvertently obtain certain messages entered by the sender of the service, thus protecting the recipient's privacy from the sender.
The application of the OT protocol in the technology is illustrated as follows:
in the following process, Alice is a demand party, Bob is a data provider, and it is assumed that Alice wants to query user information from Bob according to a mobile phone number. In order to not send the plaintext mobile phone number, both parties agree to carry out a hash of a fixed algorithm on the mobile phone number;
in order to hide the inquirer from Bob, Alice adds n-1 pieces of false information into the inquiry information, namely, sends n pieces of inquiry mobile phone numbers to Bob. N =2 in this example;
the specific process is as follows:
1. taking a query mobile phone number by Alice, adding an obfuscated mobile phone number, and performing hash on the query mobile phone number, the obfuscated mobile phone number and the hash, namely P0 and P1 (one is an obfuscated number);
2. alice sends the two inquiry numbers to Bob, and Bob inquires and obtains information M0 and M1;
3. the data provider Bob generates two pairs rsa of public-private keys and sends the two public keys puk0, puk1 to the receiver Alice;
alice generates a random number and encrypts the random number with one of the two received public keys (which key depends on which piece of data is desired to be obtained, e.g., puk0 encrypts the random number if message M0 is desired and puk1 encrypts the random number if M1 is desired), and sends the ciphertext result to Bob;
5. bob decrypts the received random number ciphertext by using two private keys of Bob to obtain two decryption results k0 and k1, and performs exclusive OR (k 0 exclusive OR M0 and k1 exclusive OR M1) on the two results and two pieces of information to be sent respectively, and sends the two results e0 and e1 to Alice;
6. and respectively carrying out exclusive OR operation on the true random number of the Alice and the received e0 and e1, wherein only one of the two obtained results is true data, and the other one is a random number.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and the preferred embodiments of the present invention are described in the above embodiments and the description, and are not intended to limit the present invention. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (8)
1. A method for establishing a multi-data-source relational graph and aligning data based on OT implementation is characterized by comprising the following steps: the method comprises the following steps:
step one, inquiring key definition;
step two, each party unifies the hash mode of the data to carry out unified hash processing on the user Key;
step three, the inquiring party inquires the user information according to the Key, such as: cell phone number P0, adding an obfuscating cell phone number such as: p1;
step four, the inquiry direction sends inquiry broadcast to A, B, C in the data network;
and step five, companies with data results such as company A obtain data M0 and M1, generate two pairs of public and private keys and send the two public keys to the inquiring party: puk0, puk 1;
step six, the inquiring party generates a random number, if P0 and P0 in P1 are real data, puk0 is used for encrypting the random number, otherwise puk1 sends a ciphertext to the providing party;
step seven, the provider decrypts the encrypted random numbers by using the two private keys respectively to obtain k0 and k1, converts M0 and M1 into binary systems, and performs exclusive-or on k0 and M0 and k1 and M1 to obtain e0 and e1, and returns the e0 and the e1 to the inquirer;
step eight, the inquiring party uses the real random number to carry out exclusive OR on e0 and e1, and then converts the binary system into a character string;
step nine, the inquiring party obtains return data from three ABC companies;
step ten, the inquirer can use the OT protocol to carry out the next round of iterative inquiry according to the inquiry graph pair B, C until all data providers are inquired.
2. The OT-based multiple data source relationship graph building and data alignment method of claim 1, wherein: the specific operation of the first step is as follows: the parties define query keys that can associate users, an example of which is as follows:
mobile phone number;
idno is the identification number;
device _ id is the device number;
bank card id the bank card number.
3. The OT-based multiple data source relationship graph building and data alignment method of claim 1, wherein: the program code of the data format example in step three is:
{"keys":{"mobiles":["P0","P1"]},"relation":["mobile","idno","device_id","bank_card_id"]}；
keys in the above definition are keys provided to the data provider for the user to be queried, one of which is true and one of which is false;
relationship refers to which keys can be associated with.
4. The OT-based multiple data source relationship graph building and data alignment method of claim 1, wherein: the query broadcast in step four is directional, that is, the broadcast objects are screened according to conditions, in the next iteration, a specific object is selected for broadcast, and the data provider A, B, C in the data network queries whether there is such a key and the data of the specified user from its own library after receiving the broadcast.
5. The OT implementation-based multiple data source relational graph building and data alignment method of claim 4, wherein: query data can be divided into:
the query can be made by a key provided by a supporting party, such as company a in the above example companies, and the user data M0 is obtained, where M1 is in the form of:
{"data":{"mobile":"P0","v1":"v1_value","v2":"v2_value","vn":"vn_value","bank_card_id":"bank_card_id_value"},"relation":{"from":"mobile","to":["bank_card_id"]}}；
the two structures are returned, and encryption is respectively carried out in the OT protocol;
the data comprises all attributes of the user and an associated key value;
the relationship field is used to identify which keys the company can associate between.
6. The OT implementation-based multiple data source relational graph building and data alignment method of claim 4, wherein: query data can also be divided into:
the data does not support the inquiry of the key provided by the inquirer user, such as: company B and company C, but other keys may be queried, then return:
company B returns:
{"relation":{"valid_key":["idno"]}}；
company C returns:
{"relation":{"valid_key":["bank_card_id","idno"]}}；
this return is not encrypted.
7. The OT-based multiple data source relationship graph building and data alignment method of claim 1, wherein: nine conclusions can be drawn from querying the data as follows:
1): c can use bank _ card _ id to inquire, and A has the bank _ card _ id value of inquiring user;
2): b can be queried again by using the idno returned by C after bank _ card _ id is obtained from C;
3): therefore, a query graph, namely A- > C- > B can be constructed, and all the data to be queried in the network can be obtained.
8. The OT-based multiple data source relationship graph building and data alignment method of claim 1, wherein: the OT protocol in the step ten is an inadvertent transmission protocol, is a two-party communication protocol capable of protecting privacy, and can enable two communication parties to transmit messages in a selected fuzzification mode; inadvertent transmission protocol is a basic protocol of cryptography that allows the recipient of a service to inadvertently obtain certain messages entered by the sender of the service, thus protecting the recipient's privacy from the sender.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110140005.4A CN113094468A (en) | 2021-02-02 | 2021-02-02 | OT-based multi-data-source relational graph construction and data alignment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110140005.4A CN113094468A (en) | 2021-02-02 | 2021-02-02 | OT-based multi-data-source relational graph construction and data alignment method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113094468A true CN113094468A (en) | 2021-07-09 |
Family
ID=76663790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110140005.4A Pending CN113094468A (en) | 2021-02-02 | 2021-02-02 | OT-based multi-data-source relational graph construction and data alignment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113094468A (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120063593A1 (en) * | 2010-09-10 | 2012-03-15 | International Business Machines Corporation | Oblivious transfer with hidden access control lists |
| CN102609421A (en) * | 2011-01-24 | 2012-07-25 | 阿里巴巴集团控股有限公司 | Data query method and device |
| US20170147835A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Efficient two party oblivious transfer using a leveled fully homomorphic encryption |
| US20170337397A1 (en) * | 2015-05-19 | 2017-11-23 | Rujing Tang | System And Method For Protecting Internet User Data Privacy |
| CN109039578A (en) * | 2018-09-04 | 2018-12-18 | 重庆第二师范学院 | Secret protection encryption method, information data processing terminal based on homomorphic cryptography |
| CN110176983A (en) * | 2019-05-22 | 2019-08-27 | 西安电子科技大学 | Privacy protection association rule mining based on full homomorphic cryptography |
| CN110661764A (en) * | 2018-06-29 | 2020-01-07 | 阿里巴巴集团控股有限公司 | Input acquisition method and device of secure multi-party computing protocol |
| CN111008236A (en) * | 2019-12-06 | 2020-04-14 | 支付宝(杭州)信息技术有限公司 | Data query method and system |
| CN111062052A (en) * | 2019-12-09 | 2020-04-24 | 支付宝(杭州)信息技术有限公司 | Data query method and system |
| CN111162906A (en) * | 2019-12-27 | 2020-05-15 | 上海市数字证书认证中心有限公司 | Collaborative secret sharing method, device, system and medium based on vast transmission algorithm |
| US20200259800A1 (en) * | 2019-02-12 | 2020-08-13 | Visa International Service Association | Fast oblivious transfers |
-
2021
- 2021-02-02 CN CN202110140005.4A patent/CN113094468A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120063593A1 (en) * | 2010-09-10 | 2012-03-15 | International Business Machines Corporation | Oblivious transfer with hidden access control lists |
| CN102609421A (en) * | 2011-01-24 | 2012-07-25 | 阿里巴巴集团控股有限公司 | Data query method and device |
| US20170337397A1 (en) * | 2015-05-19 | 2017-11-23 | Rujing Tang | System And Method For Protecting Internet User Data Privacy |
| US20170147835A1 (en) * | 2015-11-25 | 2017-05-25 | International Business Machines Corporation | Efficient two party oblivious transfer using a leveled fully homomorphic encryption |
| CN110661764A (en) * | 2018-06-29 | 2020-01-07 | 阿里巴巴集团控股有限公司 | Input acquisition method and device of secure multi-party computing protocol |
| CN109039578A (en) * | 2018-09-04 | 2018-12-18 | 重庆第二师范学院 | Secret protection encryption method, information data processing terminal based on homomorphic cryptography |
| US20200259800A1 (en) * | 2019-02-12 | 2020-08-13 | Visa International Service Association | Fast oblivious transfers |
| CN110176983A (en) * | 2019-05-22 | 2019-08-27 | 西安电子科技大学 | Privacy protection association rule mining based on full homomorphic cryptography |
| CN111008236A (en) * | 2019-12-06 | 2020-04-14 | 支付宝(杭州)信息技术有限公司 | Data query method and system |
| CN111062052A (en) * | 2019-12-09 | 2020-04-24 | 支付宝(杭州)信息技术有限公司 | Data query method and system |
| CN111162906A (en) * | 2019-12-27 | 2020-05-15 | 上海市数字证书认证中心有限公司 | Collaborative secret sharing method, device, system and medium based on vast transmission algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101027869B (en) | System and method for determining a security encoding to be applied to outgoing messages | |
| WO2004071006A1 (en) | Broadcast encryption key distribution system | |
| JPH04213242A (en) | Limited multiple address communication system | |
| CN1985461A (en) | System and method for associating message addresses with certificates | |
| CN101720071A (en) | Short message two-stage encryption transmission and secure storage method based on safety SIM card | |
| EP1119132A2 (en) | Broadcasting encrypted messages using session keys | |
| CN111177769A (en) | Private data protection list query method and related list query system | |
| CN102088352B (en) | Data encryption transmission method and system for message-oriented middleware | |
| CN105208028A (en) | Data transmission method and related device and equipment | |
| US20100005307A1 (en) | Secure approach to send data from one system to another | |
| Gao et al. | LIP‐PA: A Logistics Information Privacy Protection Scheme with Position and Attribute‐Based Access Control on Mobile Devices | |
| CN114547668A (en) | Secret trace query method and device based on country secret and index confusion | |
| GB2587438A (en) | Key generation for use in secured communication | |
| Croft et al. | Using an approximated one-time pad to secure short messaging service (SMS) | |
| CN105553979A (en) | Encryption publishing method for privacy information in smart power grid | |
| CN103188665B (en) | Improve the system of the fail safe of the mobile phone receiving advertisement, method and device | |
| Chaeikar et al. | Secure SMS transmission based on social network messages | |
| CN115828310B (en) | Data query method and device based on privacy calculation and storage medium | |
| CN116089986B (en) | Electronic document management method, device, equipment and medium capable of configuring security policy | |
| Weber | A hybrid attribute-based encryption technique supporting expressive policies and dynamic attributes | |
| Sagheer et al. | Sms security for smartphone | |
| CN113094468A (en) | OT-based multi-data-source relational graph construction and data alignment method | |
| CN107872312B (en) | Method, device, equipment and system for dynamically generating symmetric key | |
| TWI577145B (en) | Method for encrypted data transmission of near field communication device and system thereof | |
| Mutangana et al. | Wiretap channel with latent variable secrecy |
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 |