Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys

Attrapadung, Nuttapong; Furukawa, Yoshihiro; Imai, Hideki

doi:10.1007/11935230_11

Cited by 23 publications

(19 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A later study [1] examines the relationships between these two primitives and points out that if one has an anonymous IBE scheme, then he achieves secure PEKS. Attrapadung et al [2,3] introduce a new cryptographic primitive called coupling. It is a broadcast encryption that further has hierarchical identity based dimension.…”

Section: Our Contributions Our Contributions Are As Followsmentioning

confidence: 99%

“…The data owner generates the secret key for each user, and then distributes the secret key to the user. We adapt the coupling primitive in [2,3] carefully to the setting of multi-user keyword search where the data owner encrypts each file with a di↵erent key; di↵erent users are allowed to search di↵erent subset of (encrypted) files. Specifically, we couple the broadcast dimension (user index; each user is assigned an index) and the keyword dimension (keyword searchability).…”

Section: Constructionsmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Kiayias

Oksuz

Russell

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we provide a secure and e cient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) each user generates a constant size trapdoor for a keyword without getting any help from any party (e.g., data owner), independent of the number of files that he is authorized to search, and (c) for the keyword ciphertexts of a file, the network bandwidth usage (from the data owner to the server) and storage overhead at the server do not depend on the number of users that are authorized to access the file. We show that our scheme has data privacy and trapdoor privacy. While several recent studies are on secure keyword search for data sharing, we show that they either su↵er from scalability issues or lack user privacy.

show abstract

Section: Our Contributions Our Contributions Are As Followsmentioning

confidence: 99%

Section: Constructionsmentioning

confidence: 99%

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Kiayias

Oksuz

Russell

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Recently, due to the popularity of ABE, there have been some research works on ABKS [19,21]. In addition, there are also keyword search schemes for other encryption variants, such as Broadcast Encryption [2].…”

Section: Related Workmentioning

confidence: 99%

Linear Encryption with Keyword Search

Zhang

Yang

2016

Information Security and Privacy

View full text Add to dashboard Cite

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy AttributedBased Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the ℓ-DCBDH problem derived from the (P, f)-DBDH problem family. Abstract. Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the -DCBDH problem derived from the (P, f )-DBDH problem family.

show abstract

“…They also proposed identity-based searchable encryption (IBKS) from a 2-leveled anonymous hierarchical identity-based encryption (AnonHIBE). Similarly, searchable broadcasting encryption, namely broadcast encryption with keyword search (BEKS), can be constructed using 2-leveled anonymous hierarchical identitycoupling broadcast encryption (AnonHICBE) [2].…”

Section: Related Workmentioning

confidence: 99%

“…PEKS) and the multi-user setting. Broadcast encryption with keyword search [2] and attribute-based encryption with keyword search (ABKS) [12,15] are in the multiuser setting. In BEKS, the keyword is encrypted for a set of users.…”

Section: Related Workmentioning

confidence: 99%

Threshold Broadcast Encryption with Keyword Search

Zhang

Yang

2016

Information Security and Cryptology

View full text Add to dashboard Cite

Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear DiffieHellman problem. Abstract. Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.

show abstract

Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys

Cited by 23 publications

References 23 publications

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Linear Encryption with Keyword Search

Threshold Broadcast Encryption with Keyword Search

Contact Info

Product

Resources

About