Scholarlink

<p>Toward practical and client-friendly single-server private information retrieval, we introduce FlashPIR, a scheme achieving both low client overhead and high server throughput. Constructed based on fully homomorphic encryption, our protocol possesses two distinct advantages: First, a majority of the resource-intensive computations can be performed in an offline phase, prior to query reception, significantly reducing the online response time. Second, database updates operate independently of clients, with low client computational overhead remaining nearly constant regardless of the database scale. We conducted comprehensive experiments to evaluate the performance of FlashPIR. The results demonstrate that for database sizes of 256 MB, our scheme achieves a throughput <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(2.6\times\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2.6</mn> <mo>×</mo> </mrow> </math></EquationSource> </InlineEquation> greater than KsPIR (Luo et al., CCS 2024) and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(18.5\times\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>18.5</mn> <mo>×</mo> </mrow> </math></EquationSource> </InlineEquation> greater than Spiral (Menon and Wu, S&amp;P 2022).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

FlashPIR: low-latency FHE-based single-server PIR with low client overhead

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月21日

查看全文
  • Yiran Dai,
  • Binwu Xiang,
  • Lang Qin,
  • Yi Deng,
  • Jiang Zhang

摘要

Toward practical and client-friendly single-server private information retrieval, we introduce FlashPIR, a scheme achieving both low client overhead and high server throughput. Constructed based on fully homomorphic encryption, our protocol possesses two distinct advantages: First, a majority of the resource-intensive computations can be performed in an offline phase, prior to query reception, significantly reducing the online response time. Second, database updates operate independently of clients, with low client computational overhead remaining nearly constant regardless of the database scale. We conducted comprehensive experiments to evaluate the performance of FlashPIR. The results demonstrate that for database sizes of 256 MB, our scheme achieves a throughput \(2.6\times\) 2.6 × greater than KsPIR (Luo et al., CCS 2024) and \(18.5\times\) 18.5 × greater than Spiral (Menon and Wu, S&P 2022).