CN110362537A - Based on the decoded population parameter Private information retrieval method of sawtooth - Google Patents

Based on the decoded population parameter Private information retrieval method of sawtooth Download PDF

Info

Publication number
CN110362537A
CN110362537A CN201910615099.9A CN201910615099A CN110362537A CN 110362537 A CN110362537 A CN 110362537A CN 201910615099 A CN201910615099 A CN 201910615099A CN 110362537 A CN110362537 A CN 110362537A
Authority
CN
China
Prior art keywords
matrix
node
packet
sawtooth
data packet
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
CN201910615099.9A
Other languages
Chinese (zh)
Other versions
CN110362537B (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 University
Original Assignee
Shenzhen University
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 University filed Critical Shenzhen University
Priority to CN201910615099.9A priority Critical patent/CN110362537B/en
Publication of CN110362537A publication Critical patent/CN110362537A/en
Application granted granted Critical
Publication of CN110362537B publication Critical patent/CN110362537B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/10—File systems; File servers
    • G06F16/14—Details of searching files based on file metadata
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Library & Information Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Error Detection And Correction (AREA)

Abstract

The invention discloses one kind to be based on the decoded population parameter Private information retrieval method of sawtooth, the following steps are included: step S10, m file is divided into k α system packet, it is stored in k system node of distributed memory system, determine encoder matrix, coding packet is obtained according to encoder matrix, coding packet is stored in α parity check node；Step S20 generates inquiry matrix, and inquiry matrix includes random matrix and search matrix, is inquired into distributed memory system；Step S30 carries out data decoding to the second data packet returned from node, wherein node includes system node and parity check node.The present invention can be suitable for population parameter, improve the scope of application, computation complexity is low, and communications cost is low.

Description

Based on the decoded population parameter Private information retrieval method of sawtooth
Technical field
The invention belongs to technical field of information retrieval, more particularly to a kind of decoded population parameter private information of sawtooth that is based on to examine Suo Fangfa.
Background technique
Currently, the technology of information retrieval is more mature, for example number of patent application is CN107992582A, application entitled one Kind be based on the decoded Private information retrieval method of sawtooth, only done (2k, k) based on the decoded Private information retrieval of sawtooth, i.e., It is only applicable to n=2k situation, but in practice, n, k is arbitrary, and has certain limitation in the application, there are realities With the low problem of property.
Therefore, the prior art is to be improved.
Summary of the invention
It is a kind of based on the decoded population parameter Private information retrieval method of sawtooth it is a primary object of the present invention to propose, it is intended to The technical issues of solving mentioned in background technique can be suitable for (n, k) of population parameter in terms of information retrieval, improve suitable Use range.
One kind of the invention is based on the decoded population parameter Private information retrieval method of sawtooth, comprising the following steps:
Step S10, by m file s1,s2,…smIt is divided into k α system packet, is stored in k of distributed memory system In system node, encoder matrix being determined, coding packet being obtained according to encoder matrix, coding packet is stored in α parity check node In, wherein n node, α=n-k, encoder matrix are shared in distributed memory system
Step S20 generates inquiry matrix, and inquiry matrix includes random matrix U and search matrix Ef,l, to distributed storage It is inquired in system；
Step S30 carries out data decoding to the second data packet returned from node, wherein node includes system node And parity check node.
Preferably, in step slo, obtaining coding according to encoder matrix includes:
The system packet of step S100, every a line of file move to right corresponding bit according to the row vector element of encoder matrix T, It is added in two element field and obtains coding packet.
Preferably, step S30 is specifically included:
Step S31 presses the first data packet stored in node after the node of distributed memory system receives inquiry matrix Corresponding bit is moved to right according to the row vector element of inquiry matrix, is then added in two element field and obtains the second data packet, node is incited somebody to action To the second data packet returned；
Step S32 obtains the first result packet that system node is returned and the second result packet that parity check node returns, First result packet moves to right corresponding bit according to the row vector element of the encoder matrix of CP-BZD code, and then two element field, which is added, obtains Third data packet, then third data packet and the second result packet sawtooth decode to obtain the 4th data packet, wherein the second data packet packet Include the first result packet and the second result packet；
Step S33 carries out sawtooth decoding to the 4th data packet, solves α k system packet altogether.
Preferably, when n < 2k, step S20 are specifically included:
Step S21,
The search matrix and random matrix in inquiry matrix are generated, random matrix isSearch matrix For Ef,l,Ef,1It is user to search matrix transmitted by first node, wherein r =n-k, works as l=2 ..., when k, Ef,lIt is by Ef,l-1Row vector cyclic shift once obtain；
Step S22, user are sent to corresponding node for matrix is inquired.
Preferably, when n >=2k, step S20 are specifically included:
Step S25 generates search matrix and random matrix in inquiry matrix, random matrixInspection Rope matrix Ef,l=[E1,…,Ef,…,Em],l∈{k+1,k+2,…,n}；
Step S26 sends random matrix to system nodeIt is sent to parity check node random Matrix and search matrix.
It is of the invention based on the decoded population parameter Private information retrieval method of sawtooth, have the advantages that
The present invention is to use binary system based on the decoded private information retrieval scheme of sawtooth in distributed memory system Shifter-adder technology, it is able to satisfy requirement: user downloads file and does not show which file downloaded.Because using two System shifter-adder and sawtooth decoding, therefore its computation complexity is relatively low.Communications cost is relatively low.The present invention can apply Arbitrarily in (n, k) system, it is not limited by n=2k.
Detailed description of the invention
Fig. 1 is that the present invention is based on the process signals of first embodiment in the decoded population parameter Private information retrieval method of sawtooth Figure；
Fig. 2 is the refinement flow diagram for obtaining coding packet in first embodiment according to encoder matrix；
Fig. 3 is the refinement flow diagram of step S30 in first embodiment；
If Fig. 4 is that n is less than 2k, the refinement flow diagram of step S20 in first embodiment；
If Fig. 5 is that n is more than or equal to 2k, the refinement flow diagram of step S20 in first embodiment；
Fig. 6 is that the present invention is based in the decoded population parameter Private information retrieval method of sawtoothCoding packet decoded Journey；
Fig. 7 is that the present invention is based in the decoded population parameter Private information retrieval method of sawtoothSawtooth decoding process.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention. It should be noted that relational language such as " first ", " second " can be used for describing various assemblies, but these terms and unlimited Make the component.These terms are only used to distinguish a component and another component.For example, the scope of the present invention is not departed from, first group Part can be referred to as the second component, and the second component can also similarly be referred to as first assembly.Term "and/or" refers to phase It closes item and describes the combination of any one or more of item.
As shown in FIG. 1, FIG. 1 is the present invention is based on first embodiments in the decoded population parameter Private information retrieval method of sawtooth Flow diagram；
One kind of the invention is based on the decoded population parameter Private information retrieval method of sawtooth, comprising the following steps:
Step S10, by m file s1,s2,…smIt is divided into k α system packet, is stored in k of distributed memory system In system node, using CP-BZD code to m file s1,s2,…smIt is encoded, encoder matrix is determined according to k and αCoding packet is obtained according to encoder matrixCoding packet is stored in α odd even school It tests in node, wherein n node, α=n-k, encoder matrix are shared in distributed memory system
In step slo, for example, such assiIndicate i-th of file, i ∈ 1,2 ..., M },It indicatesW-th of bit, a ∈ { 1,2 ..., α }, b ∈ { 1,2 ..., k }；Coding is wrappedWherein, i is indicated With siA file is related, and x expression is encoded by the xth row coding vector of encoder matrix T, x ∈ { 1,2 ..., α }, y table Show y-th of coding packet that the same coding vector of same file is encoded into, y ∈ { 1,2 ..., α }.Specifically, file siJth The system packets of column is stored to j-th of node, j ∈ { 1,2 ..., k } because what is deposited is system packet, therefore this k node is known as be System node；By kth+x nodes of the coding packet obtained by xth row coding vector deposit, because what is deposited is coding packet, therefore this α= N-k node is known as parity check node.
Such as, it is assumed that distributed memory system has n=5 node, and wherein k=3 node is used for deposit system packet, be known as be System node, n-k=2 node store m=3 file, respectively s for depositing coding packet, referred to as parity check node, system1, s2,s3.User wants retrieval file sf, i.e. f=1, α=n-k=2, then file siIt is divided into α k=6 system packet, if each data The bit length of packet is L=10,Node 1 deposits siFirst row, node 2 deposits siSecondary series, node 3 deposits si Third column because system stores 3 files, each node stores 6 data packets.Encoder matrixsi Every a line according in matrix T vector [0,1,2] carry out bit shift, then two element field be added obtain coding packet, coding Packet includes It is stored in node 4.siEvery a line according in matrix T vector [0, 2,4] it carries out bit shift and obtains coding packet, coding includes It is stored in node 5.I.e. node 4 and node 5 are even-odd check section Point.This example is used to explain the simple application of the application, and subsequent example is related to this example.Wherein, bit indicates Bit value, bit value include the value of row vector element in encoder matrix.
Step S20 generates inquiry matrix, and inquiry matrix includes random matrix U and search matrix Ef,l, to distributed storage It is inquired in system；
In step S20, when user carries out document retrieval, inquiry matrix is generated, inquiry matrix includes random matrix U and inspection Rope matrix Ef,l, inquired into distributed memory system；The specific example of the present embodiment step S20 is together with step S30 It illustrates, is write exactly in subsequent embodiment.
Step S30 carries out data decoding to the second data packet returned from node, wherein node includes system node And parity check node.
It is of the invention based on the decoded population parameter Private information retrieval method of sawtooth, have the advantages that
The present invention is to use binary system based on the decoded private information retrieval scheme of sawtooth in distributed memory system Shifter-adder technology, it is able to satisfy requirement: user downloads file and does not show which file downloaded.Because using two System shifter-adder and sawtooth decoding, therefore its computation complexity is relatively low.Communications cost is relatively low.The present invention can apply Arbitrarily in (n, k) system, it is not limited by n=2k.The present invention is to walk with documents mentioned by background technique, difference The difference of constructed encoder matrix T and file are divided into α parts of k in rapid S10, to adapt to population parameter (n, k)；N indicates distributed The total quantity of storage system interior joint, k indicate the quantity of system node；Node includes system node and parity check node.
As shown in Figure 2, it is preferable that in step slo, obtaining coding according to encoder matrix includes:
Step S100, with CP-BZD code to m file s1,s2,…smIt is encoded, the system packet root of every a line of file Corresponding bit is moved to right according to the row vector element of encoder matrix T；
Step S101 is added in two element field and obtains coding packet.
For step S100 and step S101, for example, encoder matrixsiEvery a line according in matrix T Vector [0,1,2] carry out bit shift, then two element field be added, packet must be encoded Above-mentioned coding packet is stored in parity check node.
As shown in Figure 3, it is preferable that step S30 is specifically included:
Step S31 presses the first data packet stored in node after the node of distributed memory system receives inquiry matrix Corresponding bit is moved to right according to the row vector element of inquiry matrix, is then added in two element field and obtains the second data packet, node is incited somebody to action To the second data packet returned；
In step S31, together with step S20, for example, user needs to send k=3 inquiry to each node, this The random matrix that inquiry can be unified for that the inquiry content that user sends to each node is one 3 × 6 three times adds one 3 × 6 Search matrix.If random matrixBecause of r=n-k=2, the search matrix for being sent to node 1 isThe search matrix of node 2 is sent to by E1,1Row vector shift The search matrix of node 3 is sent to by E1,2Row vector shiftE1,4=E1,5=[0].Therefore The inquiry matrix that user issues node is Q1=U+E1,1, Q2=U+E1,2, Q3=U+E1,3, Q4=U, Q5The subscript of=U, Q indicate to The inquiry matrix that corresponding node is sent, such as Q1It is the inquiry matrix sent to node 1.The i-th row for inquiring matrix is user couple The i-th of node is inquired, i ∈ { 1,2,3 }.The data that node 1 stores are according to Q1Row vector element carry out bit shift, then Two element field is corresponding to be added, and is obtainedThree data packets, then three data packets are returned to user by node 1.Similarly node 2 willUser is returned to, node 3 willUser is returned to, node 4 willUser is returned to, node 5 willReturn to user；That is the second data packet includes what node 1 returnedThree data packets, node 2 returnThree data packets, node 3 returnThree data packets, node 4 returnThree data packets and What node 5 returnedThree data packets.
Step S32 obtains the first result packet that system node is returned and the second result packet that parity check node returns, First result packet moves to right corresponding bit according to the row vector element of the encoder matrix of CP-BZD code, and then two element field, which is added, obtains Third data packet, then third data packet and the second result packet sawtooth decode to obtain the 4th data packet, wherein the second data packet packet Include the first result packet and the second result packet
Step S33 carries out sawtooth decoding to the 4th data packet, decodes α k system packet altogether.
Above-mentioned steps S32, step S33, for n < 2k and n >=2k both of these case, step S31, step S32, step S33 is applicable in.
It is for example, right for step S32, step S33Progress is moved to right about (0,1,2) in encoder matrix T Corresponding bit, then two element field, which is added, obtains third data packet, isThen rightCarry out sawtooth It decodesAs shown in Figure 6.It is rightThe bit shift about (0,2,4) encoder matrix T, two element field are carried out again It is added third data packet, isThen rightSawtooth is carried out to decodeIt is right againCarrying out sawtooth decoding can solveSuch as Fig. 1-2.Similarly, byWithIt can decode respectivelyWithTo file s16 packets all obtain.Entire text The privacy communications cost of part retrieval
As shown in Figure 4, it is preferable that when n < 2k, step S20 are specifically included:
Step S21, generates search matrix and random matrix in inquiry matrix, and random matrix is Random matrix is the matrix that size is k × m α, and random matrix, independently of storage file, the i-th row indicates that the inquiry of i-th is random Vector, search matrix Ef,l, l=1,2 ..., k,Ef,1It is user to first Search matrix transmitted by node, the Ef,lAccording to Ef,l-1Row vector cyclic shift once obtain；As l=2 ..., k, Ef,l It is by Ef,l-1Row vector cyclic shift once obtain.As k < l≤n, Ef,l=[0], that is to say, that parity check node The search matrix of transmission is null matrix.Wherein r=n-k, as k < l≤n, search matrix is null matrix.
In the step s 21, it is assumed that user wants retrieval file sf, f ∈ { 1,2 ..., m }, user needs to each querying node K times, inquiry returns to a data packet from each node every time, then returns to nk data packet altogether, need to solve α k system packet.With Machine matrixWherein the i-th row indicates the inquiry random vector of i-th.The size of search matrix is k × m α, Wherein the i-th row indicate i-th inquiry retrieval vector, 1≤i≤k, and in each row and column at most only one 1；
Step S22, user are sent to corresponding node for matrix is inquired；It will be understood that are as follows: by search matrix and random square Corresponding node is given in paroxysm；In fact, inquiry matrix is made of search matrix and random matrix, sends and inquire to corresponding node Matrix, which is equal to, is sent to corresponding node for search matrix and random matrix.
As shown in Figure 5, it is preferable that when n >=2k, step S20 are specifically included:
Step S25 generates search matrix and random matrix in inquiry matrix, random matrixInspection Rope matrix Ef,l=[E1,…,Ef,…,Em],l∈{k+1,k+2,…,n}；Wherein, EqFor the matrix of k × α, q ∈ 1,2 ..., M }, f is f-th of file for indicating to be retrieved, EqThere was only E in submatrixfIt is not null matrix, remaining m-1 submatrix is all zero Matrix.Ef,k+1In submatrix Ef=[Ik×k,0k×(α-k)], Ef,k+2In submatrix EfIt is Ef,k+1In Ef=[Ik×k, 0k×(α-k)] in column vector ring shift right one obtain, and so on Ef,lIn submatrix EfIt is Ef,l-1In EfIn column to Amount ring shift right one obtains.User is by the inquiry matrix Q of generationxIt is sent to corresponding node, x indicates to send out to x-th of node It send.
Step S26 sends random matrix to system nodeRandom square is sent to parity check node Battle array and search matrix.
For n>=2k, as privacy communications cost with n<2k situation is.
For n >=2k, for example, it is assumed that have n=5 node in distributed memory system, wherein k=2 node For deposit system packet, referred to as system node, remaining n-k=3 node is for depositing coding packet, referred to as parity check node.If being System m=3 file of storage, respectively s1、s2、s3.Each file si, (i ∈ { 1,2,3 }) is divided into k=2 isometric data packets, Then each data packet is divided into α parts, α=n-k=3 again, i.e.,Each file is divided into α k=6 packet. siFirst row be stored in node 1, siSecondary series be stored in node 2,3 files have coexisted in storage system one, so each system section Point needs to deposit α=9 m original packet, and each parity check node is also required to deposit α=9 m coding packet.(5,2) CP- that code uses The encoder matrix of ZDsiEvery a line move to right corresponding bit by the first row element of matrix T, then two element field phase Add to obtain the second data packetIt is stored in node 3.siEvery a line press matrix T The second row element move to right corresponding bit, then two element field is added to obtain the second data packetIt is stored in node 4.siEvery a line by matrix T the third line member Element moves to right corresponding bit, and then two element field is added to obtain the second data packetIt is stored in node 5.I indicates the corresponding data packet of i-th of file.
Assuming that user wants retrieval file s1, f=1, user needs just decode file to querying node k=2 times s1.The random matrix of one α=2 × 9 k × m of user's generation firstIt is sent to system node 1, 2 inquiry matrix Q1=U, Q2=U is sent to the inquiry matrix Q of parity check node3=U+E1,3, Q4=U+E1,4, Q5=U+ E1,5, whereinIt looks into I-th row of inquiry matrix is the query vector that user inquires to node i-th, i ∈ { 1,2 ..., k }.
After system node receives inquiry matrix, bit shift can be carried out according to inquiry matrix to the data packet of storage, so It is added afterwards in two element field, each node can be obtained two new data packets, be then returned to user.It is downloaded to from node 1 It is downloaded to from node 2It is downloaded to from node 3It is downloaded to from node 4It is downloaded to from node 5
It is identical when data decoding is with n < 2k when n >=2k, therefore it will not be described here.
When the present invention, n >=2k and n < 2k, transmitted random matrix, search matrix are different, and the section sent Point object is different, therefore just adapts to population parameter (n, k).
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills Art field, is included within the scope of the present invention.

Claims (5)

1. one kind is based on the decoded population parameter Private information retrieval method of sawtooth, which comprises the following steps:
Step S10, by m file s1,s2,...smIt is divided into k α system packet, is stored in k system of distributed memory system In node, encoder matrix is determined, coding packet is obtained according to encoder matrix, coding packet is stored in α parity check node, In, n node, α=n-k, encoder matrix are shared in distributed memory system
Step S20 generates inquiry matrix, and inquiry matrix includes random matrix U and search matrix Ef,l, to distributed memory system In inquired；
Step S30 carries out data decoding to the second data packet returned from node, wherein node includes system node and surprise Even parity check node.
2. being based on the decoded population parameter Private information retrieval method of sawtooth as described in claim 1, which is characterized in that in step In S10, obtaining coding according to encoder matrix includes:
The system packet of step S100, every a line of file move to right corresponding bit according to the row vector element of encoder matrix T；
Step S101 is added in two element field and obtains coding packet.
3. being based on the decoded population parameter Private information retrieval method of sawtooth as described in claim 1, which is characterized in that step S30 It specifically includes:
Step S31, after the node of distributed memory system receives inquiry matrix, to the first data packet stored in node according to looking into The row vector element for asking matrix moves to right corresponding bit, is then added in two element field and obtains second data packet, and node will obtain Second data packet is returned；
Step S32, the second result packet that the first result packet and parity check node that acquisition system node is returned return, first As a result it wraps and moves to right corresponding bit according to the row vector element of the encoder matrix of CP-BZD code, then two element field, which is added, obtains third Data packet, then third data packet and the second result packet sawtooth decode to obtain the 4th data packet, wherein the second data packet includes the One result packet and the second result packet；
Step S33 carries out sawtooth decoding to the 4th data packet, solves α k system packet altogether.
4. being based on the decoded population parameter Private information retrieval method of sawtooth as described in claim 1, which is characterized in that as n < 2k, Step S20 is specifically included:
Step S21, generates search matrix and random matrix in inquiry matrix, and random matrix isRetrieval Matrix is Ef,l,Ef,1It is user to search matrix transmitted by first node, Wherein r=n-k, as l=2 ..., k, Ef,lIt is by Ef,l-1Row vector cyclic shift once obtain；
Step S22, user are sent to corresponding node for matrix is inquired.
5. being based on the decoded population parameter Private information retrieval method of sawtooth as described in claim 1, which is characterized in that as n >=2k, Step S20 is specifically included:
Step S25 generates search matrix and random matrix in inquiry matrix, random matrixSearch matrix Ef,l=[E1,…,Ef,…,Em],l∈{k+1,k+2,…,n}；
Step S26 sends random matrix to system nodeTo parity check node send random matrix and Search matrix.
CN201910615099.9A 2019-07-09 2019-07-09 Full-parameter private information retrieval method based on sawtooth decoding Active CN110362537B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910615099.9A CN110362537B (en) 2019-07-09 2019-07-09 Full-parameter private information retrieval method based on sawtooth decoding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910615099.9A CN110362537B (en) 2019-07-09 2019-07-09 Full-parameter private information retrieval method based on sawtooth decoding

Publications (2)

Publication Number Publication Date
CN110362537A true CN110362537A (en) 2019-10-22
CN110362537B CN110362537B (en) 2021-12-28

Family

ID=68218424

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910615099.9A Active CN110362537B (en) 2019-07-09 2019-07-09 Full-parameter private information retrieval method based on sawtooth decoding

Country Status (1)

Country Link
CN (1) CN110362537B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140072236A1 (en) * 1999-07-30 2014-03-13 Vstream Technologies Llc System, Method and Article of Manufacture for Decompressing Digital Camera Sensor Data
CN105703782A (en) * 2016-03-11 2016-06-22 深圳大学 Incremental shift matrix construction method, network coding method and system
CN107241414A (en) * 2017-06-09 2017-10-10 深圳大学 A kind of private information retrieval method and system decoded based on zigzag
CN107317844A (en) * 2017-06-02 2017-11-03 深圳大学 Distributed storage method and system based on the decodable minimum memory expense of sawtooth
CN107992582A (en) * 2017-12-07 2018-05-04 深圳大学 One kind is based on the decoded Private information retrieval method of sawtooth
CN108628697A (en) * 2017-12-15 2018-10-09 深圳大学 One kind being based on binary node restorative procedure and system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140072236A1 (en) * 1999-07-30 2014-03-13 Vstream Technologies Llc System, Method and Article of Manufacture for Decompressing Digital Camera Sensor Data
CN105703782A (en) * 2016-03-11 2016-06-22 深圳大学 Incremental shift matrix construction method, network coding method and system
CN107317844A (en) * 2017-06-02 2017-11-03 深圳大学 Distributed storage method and system based on the decodable minimum memory expense of sawtooth
CN107241414A (en) * 2017-06-09 2017-10-10 深圳大学 A kind of private information retrieval method and system decoded based on zigzag
CN107992582A (en) * 2017-12-07 2018-05-04 深圳大学 One kind is based on the decoded Private information retrieval method of sawtooth
CN108628697A (en) * 2017-12-15 2018-10-09 深圳大学 One kind being based on binary node restorative procedure and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MINGJUN DAI等: ""Bandwidth Overhead-Free Data Reconstruction Scheme for Distributed Storage Code With Low Decoding Complexity"", 《IEEE ACCESS》 *
范永骏: ""Bandwidth Overhead-Free Data Reconstruction Scheme for Distributed Storage Code With Low Decoding Complexity"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Also Published As

Publication number Publication date
CN110362537B (en) 2021-12-28

Similar Documents

Publication Publication Date Title
Ambainis Upper bound on the communication complexity of private information retrieval
Chor et al. Private information retrieval by keywords
Acedanski et al. How good is random linear coding based distributed networked storage
Beimel et al. Information-theoretic private information retrieval: A unified construction
Garg et al. Wireless and personal communications systems
CN101009516B (en) A method, system and device for data synchronization
CN108197226A (en) MPTC account status tree and MPTC block chain method for quickly retrieving
CN107241414B (en) One kind being based on the decoded private information retrieval method and system of zigzag
Gómez-Vilardebó Fundamental limits of caching: Improved bounds with coded prefetching
Gordon et al. Simple and efficient two-server ORAM
CN110109874A (en) A kind of non-stop layer distributed document retrieval method based on block chain
Zhou et al. Optimal single-server private information retrieval
US10237091B2 (en) Parallel scheduling method and system for network data transmission
CN107992582A (en) One kind is based on the decoded Private information retrieval method of sawtooth
CN110362537A (en) Based on the decoded population parameter Private information retrieval method of sawtooth
US20080195729A1 (en) Path identification for network data
CN102542019A (en) Identification code storage method and identification code storage system as well as identification code indexing method and identification code indexing system
Faudree et al. Minimum degree and dominating paths
US8819070B2 (en) Methods and apparatus for information organization and exchange
Rissner et al. Bounds on the radius and status of graphs
CN110362610A (en) Based on the decoded information retrieval method suitable for n &lt; 2k of sawtooth
Banawan et al. Private information retrieval from Byzantine and colluding databases
CN105432053B (en) Information object acquisition methods, server and user equipment
Ericsson The effects of xml compression on soap performance
Nakashima et al. Tree-based consistency maintenance scheme for peer-to-peer file sharing systems

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
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: Shenzhen Yunchuang Netcom Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047247

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231116

Application publication date: 20191022

Assignee: Yuncheng Holding (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047231

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231116

Application publication date: 20191022

Assignee: Shenzhen Suowei Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047180

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231115

Application publication date: 20191022

Assignee: Sankexiaocao (Shenzhen) Internet of Things Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980047154

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231115

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: Shenzhen chuangyue Precision Machinery Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048053

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231123

Application publication date: 20191022

Assignee: Aixunda Technology (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048047

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231123

Application publication date: 20191022

Assignee: SHENZHEN DING TUO DA ELECTROMECHANICAL Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048382

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

Application publication date: 20191022

Assignee: Shenzhen Jiahui Education Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048376

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

Application publication date: 20191022

Assignee: Shenzhen Huihong Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048375

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

Application publication date: 20191022

Assignee: Shenzhen Guangwang Bozhan Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048373

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

Application publication date: 20191022

Assignee: DISCOVERY TECHNOLOGY (SHENZHEN) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048372

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: Shenzhen Zhihui Computer Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048429

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: Shenzhen Foresea Allchips Information & Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048420

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: Easy to sign chain (Shenzhen) Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048402

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: Shenzhen Ruibotong Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048397

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: SHENZHEN LIHAI HONGJIN TECHNOLOGY CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980048392

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: SHENZHEN MAGIC-RAY TECHNOLOGY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048336

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231127

Application publication date: 20191022

Assignee: Shenzhen Lingyu Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048332

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

Application publication date: 20191022

Assignee: Matrix Origin (Shenzhen) Information Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980048322

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231124

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: JIUZHOU YANGGUANG POWER SUPPLY (SHENZHEN) CO.,LTD.

Assignor: SHENZHEN University

Contract record no.: X2023980050235

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231206

Application publication date: 20191022

Assignee: Shenzhen Huike Energy Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050230

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231206

Application publication date: 20191022

Assignee: Shenzhen Huike Storage Technology Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980050228

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231205

Application publication date: 20191022

Assignee: Shenzhen Youyou Internet Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980049890

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231204

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: SHENZHEN QIANHAI MYTIME TECHNOLOGY HOLDING Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980051425

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231211

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20191022

Assignee: SHENZHEN HUIKE PRECISION INDUSTRY Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980052469

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231214

Application publication date: 20191022

Assignee: Xingang Intellectual Property Technology (Shenzhen) Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980052131

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231214

Application publication date: 20191022

Assignee: Shenzhen Shoucheng Enterprise Management Consulting Co.,Ltd.

Assignor: SHENZHEN University

Contract record no.: X2023980052091

Denomination of invention: A Full Parameter Private Information Retrieval Method Based on Sawtooth Decoding

Granted publication date: 20211228

License type: Common License

Record date: 20231213

EE01 Entry into force of recordation of patent licensing contract