| Predicate |
Object |
| assignee |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_2fadcae3196ca725b795713aa49cd9f1 |
| classificationCPCAdditional |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L2209-46 |
| classificationCPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-244
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2455
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-2237
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-248
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-088
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-0894
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04L9-085 |
| classificationIPCInventive |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-22
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-2455
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-24
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-242
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04L9-08
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F16-248 |
| filingDate |
2020-12-18-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| grantDate |
2022-04-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor |
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_8f2561a8238b02efcdbb34ed3190b41d
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_23f8fab0d553e19c96a7ea6aa74af813 |
| publicationDate |
2022-04-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber |
US-11308081-B1 |
| titleOfInvention |
Private information retrieval using one query to perform multiple retrievals |
| abstract |
A method and apparatus for private information retrieval from a database, wherein the retrieval includes providing a covering vector for a plurality of database entries of the database. The covering vector is defined such that an inner product of the covering vector is zero with more than one member of a covering vector family that includes the covering vector. The retrieval includes generating database queries based on the covering vector and transmitting the database queries to at least two servers. An identical copy of the database may be stored on each of the at least two servers. Shares are received in response to the query, and these shares are aggregated, and a reconstruction algorithm executes to reconstruct the query results. |
| priorityDate |
2020-12-18-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type |
http://data.epo.org/linked-data/def/patent/Publication |