Scholarlink

<p>We propose a new and straightforward functional encryption scheme for the bounded-norm inner-product functionality (IPFE) in the public-key setting. We prove the security of the proposed scheme with respect to standard assumptions. Specifically, our construction is secure under the Inverse Decisional Diffie–Hellman computational hardness assumption (DDHI), which, to the best of our knowledge, is not known to imply or be implied by DDH. Along the way, we rely on a novel proof technique, chiefly exploiting the algebraic properties enabled by regarding matrices as linear maps between vector spaces. The cost of proofs is reflected in terms of efficiency, where we achieve constructions with larger keys and ciphertexts when compared to the existing schemes.</p>

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

A simple inner-product functional encryption scheme from the inverse-DDH assumption

  • 期刊论文

  • 发表日期：

    2025年6月25日

查看全文
  • Rajeev Anand Sahu,
  • Jim Jean-Pierre Barthel,
  • Răzvan Roşie

摘要

We propose a new and straightforward functional encryption scheme for the bounded-norm inner-product functionality (IPFE) in the public-key setting. We prove the security of the proposed scheme with respect to standard assumptions. Specifically, our construction is secure under the Inverse Decisional Diffie–Hellman computational hardness assumption (DDHI), which, to the best of our knowledge, is not known to imply or be implied by DDH. Along the way, we rely on a novel proof technique, chiefly exploiting the algebraic properties enabled by regarding matrices as linear maps between vector spaces. The cost of proofs is reflected in terms of efficiency, where we achieve constructions with larger keys and ciphertexts when compared to the existing schemes.