Scholarlink

We present almost-optimal lattice-based attribute-based encryption (ABE) and laconic function evaluation (LFE). For depth d circuits over \(\ell \) -bit inputs, we obtain where \(O(\cdot )\) hides \(\textsf{poly}(d,\lambda )\) factors. Our parameter sizes are optimal, up to the \(\textsf{poly}(d)\) dependencies. The security of our schemes rely on succinct LWE (Wee, CRYPTO 2024). Our results constitute a substantial improvement over the state of the art; none of our results were known even under the stronger evasive LWE assumption.

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

Almost Optimal KP and CP-ABE for Circuits from Succinct LWE

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Hoeteck Wee

摘要

We present almost-optimal lattice-based attribute-based encryption (ABE) and laconic function evaluation (LFE). For depth d circuits over \(\ell \) -bit inputs, we obtain where \(O(\cdot )\) hides \(\textsf{poly}(d,\lambda )\) factors. Our parameter sizes are optimal, up to the \(\textsf{poly}(d)\) dependencies. The security of our schemes rely on succinct LWE (Wee, CRYPTO 2024). Our results constitute a substantial improvement over the state of the art; none of our results were known even under the stronger evasive LWE assumption.