FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3132273886> ?p ?o ?g. }

• W3132273886 abstract "This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR system, a user aims to retrieve one out of $K$ files from $N$ servers while revealing nothing about its identity to any individual server, in which the $K$ files are stored at the $N$ servers in an uncoded form and each server can store up to $mu K$ equivalent files, where $mu$ is the normalized storage capacity of each server. We first prove that there exists a capacity-achieving SC-PIR scheme for a given storage design if and only if all the packets are stored exactly at $Mtriangleq mu N$ servers for $mu$ such that $M=mu Nin{2,3,ldots,N}$. Then, the optimal sub-packetization for capacity-achieving linear SC-PIR schemes is characterized as the solution to an optimization problem, which is typically hard to solve because of involving indicator functions. Moreover, a new notion of array called Storage Design Array (SDA) is introduced for the SC-PIR system. With any given SDA, an associated capacity-achieving SC-PIR scheme is constructed. Next, the SC-PIR schemes that have equal-size packets are investigated. Furthermore, the optimal equal-size sub-packetization among all capacity-achieving linear SC-PIR schemes characterized by Woolsey et al. is proved to be $frac{N(M-1)}{gcd(N,M)}$. Finally, by allowing unequal size of packets, a greedy SDA construction is proposed, where the sub-packetization of the associated SC-PIR scheme is upper bounded by $frac{N(M-1)}{gcd(N,M)}$. Among all capacity-achieving linear SC-PIR schemes, the sub-packetization is optimal when $min{M,N-M}|N$ or $M=N$, and within a multiplicative gap $frac{min{M,N-M}}{gcd(N,M)}$ of the optimal one otherwise. In particular, for the case $N=dcdot Mpm1$ where $dgeq 2$, another SDA is constructed to obtain lower sub-packetization." @default.
• W3132273886 created "2021-03-01" @default.
• W3132273886 creator A5000790951 @default.
• W3132273886 creator A5029840191 @default.
• W3132273886 creator A5035654256 @default.
• W3132273886 creator A5051259190 @default.
• W3132273886 date "2021-02-16" @default.
• W3132273886 modified "2023-09-24" @default.
• W3132273886 title "Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization" @default.
• W3132273886 cites W1552623664 @default.
• W3132273886 cites W1574024822 @default.
• W3132273886 cites W1619839175 @default.
• W3132273886 cites W171567834 @default.
• W3132273886 cites W1822223425 @default.
• W3132273886 cites W1934398053 @default.
• W3132273886 cites W1963094505 @default.
• W3132273886 cites W1967703498 @default.
• W3132273886 cites W1986070285 @default.
• W3132273886 cites W1990395546 @default.
• W3132273886 cites W2007725949 @default.
• W3132273886 cites W2106248279 @default.
• W3132273886 cites W2145355783 @default.
• W3132273886 cites W2150307013 @default.
• W3132273886 cites W2345761008 @default.
• W3132273886 cites W2531251918 @default.
• W3132273886 cites W2549939309 @default.
• W3132273886 cites W2599749253 @default.
• W3132273886 cites W2793858273 @default.
• W3132273886 cites W2885836992 @default.
• W3132273886 cites W2886411684 @default.
• W3132273886 cites W2888580722 @default.
• W3132273886 cites W2961382438 @default.
• W3132273886 cites W2962692592 @default.
• W3132273886 cites W2963098339 @default.
• W3132273886 cites W2963294985 @default.
• W3132273886 cites W2970151185 @default.
• W3132273886 cites W2973612336 @default.
• W3132273886 cites W2976957157 @default.
• W3132273886 cites W3005832604 @default.
• W3132273886 cites W3080270214 @default.
• W3132273886 cites W3084711314 @default.
• W3132273886 cites W3085354969 @default.
• W3132273886 cites W3098870865 @default.
• W3132273886 cites W3100195636 @default.
• W3132273886 cites W3105958450 @default.
• W3132273886 cites W3124990156 @default.
• W3132273886 doi "https://doi.org/10.48550/arxiv.2102.08058" @default.
• W3132273886 hasPublicationYear "2021" @default.
• W3132273886 type Work @default.
• W3132273886 sameAs 3132273886 @default.
• W3132273886 citedByCount "0" @default.
• W3132273886 crossrefType "posted-content" @default.
• W3132273886 hasAuthorship W3132273886A5000790951 @default.
• W3132273886 hasAuthorship W3132273886A5029840191 @default.
• W3132273886 hasAuthorship W3132273886A5035654256 @default.
• W3132273886 hasAuthorship W3132273886A5051259190 @default.
• W3132273886 hasBestOaLocation W31322738861 @default.
• W3132273886 hasConcept C118615104 @default.
• W3132273886 hasConcept C134306372 @default.
• W3132273886 hasConcept C158379750 @default.
• W3132273886 hasConcept C31258907 @default.
• W3132273886 hasConcept C33923547 @default.
• W3132273886 hasConcept C38652104 @default.
• W3132273886 hasConcept C41008148 @default.
• W3132273886 hasConcept C77618280 @default.
• W3132273886 hasConcept C93996380 @default.
• W3132273886 hasConcept C99221444 @default.
• W3132273886 hasConceptScore W3132273886C118615104 @default.
• W3132273886 hasConceptScore W3132273886C134306372 @default.
• W3132273886 hasConceptScore W3132273886C158379750 @default.
• W3132273886 hasConceptScore W3132273886C31258907 @default.
• W3132273886 hasConceptScore W3132273886C33923547 @default.
• W3132273886 hasConceptScore W3132273886C38652104 @default.
• W3132273886 hasConceptScore W3132273886C41008148 @default.
• W3132273886 hasConceptScore W3132273886C77618280 @default.
• W3132273886 hasConceptScore W3132273886C93996380 @default.
• W3132273886 hasConceptScore W3132273886C99221444 @default.
• W3132273886 hasLocation W31322738861 @default.
• W3132273886 hasOpenAccess W3132273886 @default.
• W3132273886 hasPrimaryLocation W31322738861 @default.
• W3132273886 hasRelatedWork W1547841080 @default.
• W3132273886 hasRelatedWork W2026137130 @default.
• W3132273886 hasRelatedWork W2058498246 @default.
• W3132273886 hasRelatedWork W2371023786 @default.
• W3132273886 hasRelatedWork W2608199279 @default.
• W3132273886 hasRelatedWork W2787247443 @default.
• W3132273886 hasRelatedWork W2962944871 @default.
• W3132273886 hasRelatedWork W2963190045 @default.
• W3132273886 hasRelatedWork W2991146084 @default.
• W3132273886 hasRelatedWork W4298332009 @default.
• W3132273886 isParatext "false" @default.
• W3132273886 isRetracted "false" @default.
• W3132273886 magId "3132273886" @default.
• W3132273886 workType "article" @default.