The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
PEKS(키워드 검색을 통한 공개 키 암호화)는 일반 텍스트를 복구하지 않고도 암호문에서 특정 키워드를 검색할 수 있게 해주는 암호화 기본 기술입니다. 클라우드 서비스에서 PEKS를 사용하면 사용자는 검색 기능을 희생하지 않고도 암호화된 형식으로 데이터를 아웃소싱할 수 있습니다. 논리적 분리 및 논리적 연결을 검색 조건으로 지정할 수 있는 PEKS에 대해서는 이러한 PEKS가 (일반적으로) 익명 속성 기반 암호화(ABE)로 구성될 수 있는 것으로 알려져 있습니다. 그러나 큰 계산/통신 비용과 강력한 수학적 가정이 필요할 수 있는 ABE를 사용하지 않고 이러한 유형의 PEKS를 구성하는 것이 가능한지 여부는 명확하지 않습니다. 본 논문에서는 위의 기능을 갖춘 PEKS를 구성하는 데 ABE가 중요하다는 것을 보여줍니다. 보다 구체적으로, 검색 조건이 논리적 분리 및 논리적 연결로 지정되는 PEKS의 익명 키 정책 ABE의 일반적인 구성을 제공합니다. 우리의 결과는 이러한 PEKS가 항상 큰 계산/통신 비용과 ABE에 해당하는 강력한 수학적 가정을 필요로 함을 의미합니다.
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.
부
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
부
@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},}
부
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 -