• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Access pattern hiding searchable symmetric encryption scheme

Research Project

Project/Area Number 17K00177
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Information security
Research InstitutionIbaraki University

Principal Investigator

Kurosawa Kaoru  茨城大学, 理工学研究科(工学野), 教授 (60153409)

Project Period (FY) 2017-04-01 – 2020-03-31
Project Status Completed (Fiscal Year 2019)
Budget Amount *help
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2017: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Keywords暗号 / キーワード検索 / アクセス情報 / PIR / 誤り訂正 / アクセスパターン / 情報理論的安全性 / 共通鍵暗号 / 辞書
Outline of Final Research Achievements

In the model of searchable symmetric encryption schemes, the user wants to obtain the files which includes the keyword keeping the keyword and files secret. In the model of private information retrieval (PIR), a server S holds a database x = (x1, . . . , xn) ∈{0, 1}n, and a user holds a secret index i_0. The user should be able to retrieve x_{i_0} without revealing no information on i_0. In this research, it is shown that we can construct a searchable symmetric encryption scheme which can hide even the access pattern from the server by combining any PIR scheme with cuckoo hashing, where the user does not need to keep the set of keywords. Further in the information theoretic setting, an efficient decoding algorithm is shown for a b error correcting L server PIR scheme. It runs in time O(L^3).

Academic Significance and Societal Importance of the Research Achievements

クライアントは、暗号化したファイルの集合をサーバに格納しておき、検索キーワードを秘密にしたままそのキーワードを含むファイルを取り出したい。このように、情報セキュリティと利便性という相反する2つの目的を両立させる暗号方式をキーワード検索可能暗号方式という。本研究では、まず、カッコーハッシュとprivate information retrieval(PIR)を組み合わせると、ユーザはキーワード集合を記憶しておくことなく、アクセス情報も秘匿できるキーワード検索可能暗号を構成できることを示した。次に、b重誤り訂正LサーバPIR 方式に対し計算量がLの3乗のオーダーで済む効率のよい復号法を開発した。

Report

(4 results)
  • 2019 Annual Research Report   Final Research Report ( PDF )
  • 2018 Research-status Report
  • 2017 Research-status Report
  • Research Products

    (4 results)

All 2019 2018 2017

All Journal Article (2 results) (of which Peer Reviewed: 2 results,  Open Access: 1 results) Presentation (2 results) (of which Int'l Joint Research: 1 results,  Invited: 1 results)

  • [Journal Article] No-Dictionary Searchable Symmetric Encryption2019

    • Author(s)
      Wakaha Ogata and Kaoru Kurosawa:
    • Journal Title

      IEICE Transactions (1)

      Volume: 102-A (1) Pages: 114-124

    • NAID

      130007541662

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Efficient No-dictionary Verifiable Searchable Symmetric Encryption2017

    • Author(s)
      Wakaha Ogata, Kaoru Kurosawa
    • Journal Title

      Financial Cryptography 2017, LNCS 10322, Springer

      Volume: LNCS 10322 Pages: 498-516

    • Related Report
      2017 Research-status Report
    • Peer Reviewed
  • [Presentation] How to Correct Errors in Multi-server PIR2019

    • Author(s)
      Kaoru Kurosawa
    • Organizer
      ASIACRYPT 2019
    • Related Report
      2019 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 辞書なし検索可能暗号について2018

    • Author(s)
      黒澤馨
    • Organizer
      情報理論とその応用シンポジウム特別セッション(情報セキュリティ)
    • Related Report
      2018 Research-status Report
    • Invited

URL: 

Published: 2017-04-28   Modified: 2021-02-19  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi