Functional Encryption for Pattern Matching with a Hidden String

We propose a new functional encryption for pattern matching scheme with a hidden string. In functional encryption for pattern matching (FEPM), access to a message is controlled by its description and a private key that is used to evaluate the description for decryption. In particular, the descriptio...

Full description

Bibliographic Details
Main Authors: Jongkil Kim, Yang-Wai Chow, Willy Susilo, Joonsang Baek, Intae Kim
Format: Article
Language:English
Published: MDPI AG 2021-12-01
Series:Cryptography
Subjects:
Online Access:https://www.mdpi.com/2410-387X/6/1/1
_version_ 1828143329444888576
author Jongkil Kim
Yang-Wai Chow
Willy Susilo
Joonsang Baek
Intae Kim
author_facet Jongkil Kim
Yang-Wai Chow
Willy Susilo
Joonsang Baek
Intae Kim
author_sort Jongkil Kim
collection DOAJ
description We propose a new functional encryption for pattern matching scheme with a hidden string. In functional encryption for pattern matching (FEPM), access to a message is controlled by its description and a private key that is used to evaluate the description for decryption. In particular, the description with which the ciphertext is associated is an arbitrary string <i>w</i> and the ciphertext can only be decrypted if its description matches the predicate of a private key which is also a string. Therefore, it provides fine-grained access control through pattern matching alone. Unlike related schemes in the literature, our scheme hides the description that the ciphertext is associated with. In many practical scenarios, the description of the ciphertext cannot be public information as an attacker may abuse the message description to identify the data owner or classify the target ciphertext before decrypting it. Moreover, some data owners may not agree to reveal any ciphertext information since it simply gives greater advantage to the adversary. In this paper, we introduce the first FEPM scheme with a hidden string, such that the adversary cannot get any information about the ciphertext from its description. The security of our scheme is formally analyzed. The proposed scheme provides both confidentiality and anonymity while maintaining its expressiveness. We prove these security properties under the interactive general Diffie–Hellman assumption (i-GDH) and a static assumption introduced in this paper.
first_indexed 2024-04-11T19:55:26Z
format Article
id doaj.art-037626a03dcf496ab460d1b0fbb1f80f
institution Directory Open Access Journal
issn 2410-387X
language English
last_indexed 2024-04-11T19:55:26Z
publishDate 2021-12-01
publisher MDPI AG
record_format Article
series Cryptography
spelling doaj.art-037626a03dcf496ab460d1b0fbb1f80f2022-12-22T04:06:02ZengMDPI AGCryptography2410-387X2021-12-0161110.3390/cryptography6010001Functional Encryption for Pattern Matching with a Hidden StringJongkil Kim0Yang-Wai Chow1Willy Susilo2Joonsang Baek3Intae Kim4Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, AustraliaInstitute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, AustraliaInstitute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, AustraliaInstitute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, AustraliaInstitute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Wollongong, NSW 2522, AustraliaWe propose a new functional encryption for pattern matching scheme with a hidden string. In functional encryption for pattern matching (FEPM), access to a message is controlled by its description and a private key that is used to evaluate the description for decryption. In particular, the description with which the ciphertext is associated is an arbitrary string <i>w</i> and the ciphertext can only be decrypted if its description matches the predicate of a private key which is also a string. Therefore, it provides fine-grained access control through pattern matching alone. Unlike related schemes in the literature, our scheme hides the description that the ciphertext is associated with. In many practical scenarios, the description of the ciphertext cannot be public information as an attacker may abuse the message description to identify the data owner or classify the target ciphertext before decrypting it. Moreover, some data owners may not agree to reveal any ciphertext information since it simply gives greater advantage to the adversary. In this paper, we introduce the first FEPM scheme with a hidden string, such that the adversary cannot get any information about the ciphertext from its description. The security of our scheme is formally analyzed. The proposed scheme provides both confidentiality and anonymity while maintaining its expressiveness. We prove these security properties under the interactive general Diffie–Hellman assumption (i-GDH) and a static assumption introduced in this paper.https://www.mdpi.com/2410-387X/6/1/1functional encryptionpattern matching systemsearchable encryption
spellingShingle Jongkil Kim
Yang-Wai Chow
Willy Susilo
Joonsang Baek
Intae Kim
Functional Encryption for Pattern Matching with a Hidden String
Cryptography
functional encryption
pattern matching system
searchable encryption
title Functional Encryption for Pattern Matching with a Hidden String
title_full Functional Encryption for Pattern Matching with a Hidden String
title_fullStr Functional Encryption for Pattern Matching with a Hidden String
title_full_unstemmed Functional Encryption for Pattern Matching with a Hidden String
title_short Functional Encryption for Pattern Matching with a Hidden String
title_sort functional encryption for pattern matching with a hidden string
topic functional encryption
pattern matching system
searchable encryption
url https://www.mdpi.com/2410-387X/6/1/1
work_keys_str_mv AT jongkilkim functionalencryptionforpatternmatchingwithahiddenstring
AT yangwaichow functionalencryptionforpatternmatchingwithahiddenstring
AT willysusilo functionalencryptionforpatternmatchingwithahiddenstring
AT joonsangbaek functionalencryptionforpatternmatchingwithahiddenstring
AT intaekim functionalencryptionforpatternmatchingwithahiddenstring