Scholarlink

Public key encryption with keyword search (PEKS) enables one to perform search on encrypted data. In 2005, Abdalla et al. proved that PEKS can be generically constructed from anonymous identity-based encryption (IBE) schemes. To the best of our knowledge, all existing lattice-based PEKS schemes have been constructed by this conversion. In this paper, we simplify the generically constructed PEKS schemes when the underlying IBE is the lattice-based scheme proposed by Agrawal et al. (EUROCRYPT 2010) or its variants. Then, we prove that the new construction satisfies the essential properties for PEKS. Our framework includes the most efficient new LWE-based PEKS in the standard model. Moreover, our methodology can be applied to PEKS with advanced functionalities.

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

Simple Construction of PEKS from LWE-Based IBE in the Standard Model

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Hirotomo Shinoki,
  • Hisayoshi Sato,
  • Masayuki Yoshino

摘要

Public key encryption with keyword search (PEKS) enables one to perform search on encrypted data. In 2005, Abdalla et al. proved that PEKS can be generically constructed from anonymous identity-based encryption (IBE) schemes. To the best of our knowledge, all existing lattice-based PEKS schemes have been constructed by this conversion. In this paper, we simplify the generically constructed PEKS schemes when the underlying IBE is the lattice-based scheme proposed by Agrawal et al. (EUROCRYPT 2010) or its variants. Then, we prove that the new construction satisfies the essential properties for PEKS. Our framework includes the most efficient new LWE-based PEKS in the standard model. Moreover, our methodology can be applied to PEKS with advanced functionalities.