容量達成型ビザンチン耐性プライベート情報検索方式の最適ファイルサイズについて
Stanislav Kruglik1, Han Mao Kiah2, Son Hoang Dau3
1Department of Electrical and Photonics Engineering, Technical University of Denmark, 2800 Kongens Lyngby, Denmark.
Abstract:
We consider the problem of designing a Private Information Retrieval (PIR) scheme for n files replicated on k servers that can collude and return incorrect answers. Our goal is to correctly retrieve a specific message while keeping its identity private from the database servers. We focus on minimizing download costs and propose PIR schemes with minimal download costs and the smallest file size (proportional to the number of involved servers). Motivated by the possible presence of stragglers, we extend our previous conference results and propose a scheme in which the number of participating servers may vary.
関連する概念動画
Lung Capacity
Retrieval
Recall involves accessing information without cues, such as during an essay test, where individuals must retrieve facts and concepts from memory unaided. Another example is remembering the name of a colleague...
The Z-Scheme of Electron Transport in Photosynthesis
Cell Size
Surface Area
Cells can take in nutrients and water via diffusion through the plasma membrane itself or through specific channels in the membrane. The area of the membrane surrounding...
ER Retrieval Pathway
The ER uses many checkpoints to prevent the entry of incorrectly folded or a resident protein as cargo onto a transport vesicle. These mechanisms...
Respiratory Capacities
One key metric is the Inspiratory Capacity (IC), which represents the maximum amount of air that can be inhaled with full effort. IC is calculated by summing the tidal volume and inspiratory reserve volume, typically ranging from 2.4 to 3.6 liters.
The Functional Residual Capacity (FRC) represents the air in the...


