The search functionality is under construction.

The search functionality is under construction.

Public-key encryption with keyword search (PEKS) is a cryptographic primitive that allows us to search for particular keywords over ciphertexts without recovering plaintexts. By using PEKS in cloud services, users can outsource their data in encrypted form without sacrificing search functionality. Concerning PEKS that can specify logical disjunctions and logical conjunctions as a search condition, it is known that such PEKS can be (generically) constructed from anonymous attribute-based encryption (ABE). However, it is not clear whether it is possible to construct this types of PEKS without using ABE which may require large computational/communication costs and strong mathematical assumptions. In this paper, we show that ABE is crucial for constructing PEKS with the above functionality. More specifically, we give a generic construction of anonymous key-policy ABE from PEKS whose search condition is specified by logical disjunctions and logical conjunctions. Our result implies such PEKS always requires large computational/communication costs and strong mathematical assumptions corresponding to those of ABE.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.107-113

- Publication Date
- 2020/01/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.2019CIP0014

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category

Junichiro HAYATA

The University of Tokyo,the National Institute of Advanced Industrial Science and Technology

Masahito ISHIZAKA

The University of Tokyo

Yusuke SAKAI

the National Institute of Advanced Industrial Science and Technology

Goichiro HANAOKA

the National Institute of Advanced Industrial Science and Technology

Kanta MATSUURA

The University of Tokyo

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Junichiro HAYATA, Masahito ISHIZAKA, Yusuke SAKAI, Goichiro HANAOKA, Kanta MATSUURA, "Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable Encryption" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 107-113, January 2020, doi: 10.1587/transfun.2019CIP0014.

Abstract: Public-key encryption with keyword search (PEKS) is a cryptographic primitive that allows us to search for particular keywords over ciphertexts without recovering plaintexts. By using PEKS in cloud services, users can outsource their data in encrypted form without sacrificing search functionality. Concerning PEKS that can specify logical disjunctions and logical conjunctions as a search condition, it is known that such PEKS can be (generically) constructed from anonymous attribute-based encryption (ABE). However, it is not clear whether it is possible to construct this types of PEKS without using ABE which may require large computational/communication costs and strong mathematical assumptions. In this paper, we show that ABE is crucial for constructing PEKS with the above functionality. More specifically, we give a generic construction of anonymous key-policy ABE from PEKS whose search condition is specified by logical disjunctions and logical conjunctions. Our result implies such PEKS always requires large computational/communication costs and strong mathematical assumptions corresponding to those of ABE.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIP0014/_p

Copy

@ARTICLE{e103-a_1_107,

author={Junichiro HAYATA, Masahito ISHIZAKA, Yusuke SAKAI, Goichiro HANAOKA, Kanta MATSUURA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable Encryption},

year={2020},

volume={E103-A},

number={1},

pages={107-113},

abstract={Public-key encryption with keyword search (PEKS) is a cryptographic primitive that allows us to search for particular keywords over ciphertexts without recovering plaintexts. By using PEKS in cloud services, users can outsource their data in encrypted form without sacrificing search functionality. Concerning PEKS that can specify logical disjunctions and logical conjunctions as a search condition, it is known that such PEKS can be (generically) constructed from anonymous attribute-based encryption (ABE). However, it is not clear whether it is possible to construct this types of PEKS without using ABE which may require large computational/communication costs and strong mathematical assumptions. In this paper, we show that ABE is crucial for constructing PEKS with the above functionality. More specifically, we give a generic construction of anonymous key-policy ABE from PEKS whose search condition is specified by logical disjunctions and logical conjunctions. Our result implies such PEKS always requires large computational/communication costs and strong mathematical assumptions corresponding to those of ABE.},

keywords={},

doi={10.1587/transfun.2019CIP0014},

ISSN={1745-1337},

month={January},}

Copy

TY - JOUR

TI - Generic Construction of Adaptively Secure Anonymous Key-Policy Attribute-Based Encryption from Public-Key Searchable Encryption

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 107

EP - 113

AU - Junichiro HAYATA

AU - Masahito ISHIZAKA

AU - Yusuke SAKAI

AU - Goichiro HANAOKA

AU - Kanta MATSUURA

PY - 2020

DO - 10.1587/transfun.2019CIP0014

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E103-A

IS - 1

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - January 2020

AB - Public-key encryption with keyword search (PEKS) is a cryptographic primitive that allows us to search for particular keywords over ciphertexts without recovering plaintexts. By using PEKS in cloud services, users can outsource their data in encrypted form without sacrificing search functionality. Concerning PEKS that can specify logical disjunctions and logical conjunctions as a search condition, it is known that such PEKS can be (generically) constructed from anonymous attribute-based encryption (ABE). However, it is not clear whether it is possible to construct this types of PEKS without using ABE which may require large computational/communication costs and strong mathematical assumptions. In this paper, we show that ABE is crucial for constructing PEKS with the above functionality. More specifically, we give a generic construction of anonymous key-policy ABE from PEKS whose search condition is specified by logical disjunctions and logical conjunctions. Our result implies such PEKS always requires large computational/communication costs and strong mathematical assumptions corresponding to those of ABE.

ER -