Towards secure data sharing in cloud computing using attribute based proxy re-encryption with keyword search

Hong, Hanshu; Sun, Zhixin

doi:10.1109/icccbda.2017.7951914

Cited by 8 publications

(11 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whether users or regulator, (sek DO , loc DO ) is extremely critical information to decrypt and search DO's private data and judge the legality of content. For encrypting it over the attribute {A j }, DO will use 𝛿 DO and PK, and utilize ABPRE-KS algorithm 31 AK to calculate…”

Section: Ta B L Ementioning

confidence: 99%

“…In 2017, Hong et al 31 put forward the attribute‐based proxy re‐encryption with keyword search algorithm under cloud computing environment, called ABPRE‐KS. By integrating attribute‐based proxy re‐encryption algorithm and keyword search algorithm, the algorithm guarantees the safety and privacy of data sharing under the situation of the ciphertext status and participant's attributes match, and further provides better flexible and secure data access control among participants.…”

Section: Preliminariesmentioning

confidence: 99%

“…In this section, we design a privacy‐preserving data sharing scheme, called DBSDS, which introduces a dual‐blockchain structure supporting supervision to share private data, generates a hierarchical user key tracing tree 20 to police illegal users, and utilizes ABPRE‐KS scheme proposed by Hong et al 31 to increase flexibility and safety in the data sharing process.…”

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

“…The specific process of initialization and user registration can be described as: System initialization: As defined in ABPRE‐KS algorithm, 31 AA defines two

p

order groups

{G}_1,{G}_2

, a bilinear pairing

\hat{e}:{G}_1\times {G}_1\to {G}_2

, two generators

{g}_1,{g}_2

{G}_1

, a global attribute set

S

, picks two hash functions:

{H}_1:{\left\{0,1\right\}}^{\ast}\to {G}_1

and

{H}_2:{\left\{0,1\right\}}^{\ast}\to {Z}_p^{\ast }

, chooses

y\in {Z}_p^{\ast }

, computes

Y=\hat{e}{\left({g}_1,{g}_2\right)}^y

and selects

t_{i}

…”

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

“…Whether users or regulator, (

{\mathrm{sek}}_{\mathrm{DO}}

{\mathrm{loc}}_{\mathrm{DO}}

) is extremely critical information to decrypt and search DO's private data and judge the legality of content. For encrypting it over the attribute

\left\{{A}_j\right\}

, DO will use

{\delta}_{\mathrm{DO}}

and PK, and utilize ABPRE‐KS algorithm 31

\mathrm{AK}

to calculate

\begin{matrix} alignleft \\ align-1 C_{ori} & align-2 = AK . Enc (s e k_{DO}, {loc}_{DO}, PK) = {C_{key}, C_{loc}, C_{1}, C_{2}, C_{3, j}}, \\ align-1 C_{key} & align-2 = ({sek}_{DO}) \cdot Y^{δ_{DO}}, C_{loc} = ({loc}_{DO}) \cdot Y^{δ_{DO}}, \\ align-1 C_{1} & align-2 = g_{1}^{δ_{DO}}, C_{2} = g_{2}^{δ_{DO}}, C_{3, j} \end{matrix}

…”

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

See 4 more Smart Citations

DBSDS: A dual‐blockchain security data sharing model with supervision and privacy‐protection

Zhang

Luo

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

With the rapid development of big data technology and applications, sharing and supervision of massive data have become the demand of industry development. As an emerging technology, blockchain, with excellent characteristics, can promote the prosperity and development of the data‐sharing industry. However, the existing blockchain may lead to some privacy and security issues due to its transparency and lack of supervision. Hence, a secure data sharing model with supervision and privacy protection, named DBSDS, was proposed, which supports illegal content supervision and users revocation, and possesses flexible and fine‐grained access control on data sharing. Firstly, it introduces a dual‐blockchain architecture, one blockchain is used to ensure the integrity and traceability of private data and another is utilized to supervise illegal users so that they can no longer upload and share private data. Secondly, a key tracing tree was built and correspondingly different key generation strategies for different users were designed, which endows regulators with supervision capabilities. Finally, combined ABPER‐KS algorithm, both privacy protection and fine‐grained access control on private data can be accomplished. Furthermore, security analysis and performance comparison manifest that DBSDS is safe and owns better performance, and scheme implementation and experimental analysis indicate the practicality of DBSDS.

show abstract

Section: Ta B L Ementioning

confidence: 99%

Section: Preliminariesmentioning

confidence: 99%

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

“…The specific process of initialization and user registration can be described as: System initialization: As defined in ABPRE‐KS algorithm, 31 AA defines two

p

order groups

{G}_1,{G}_2

, a bilinear pairing

\hat{e}:{G}_1\times {G}_1\to {G}_2

, two generators

{g}_1,{g}_2

{G}_1

, a global attribute set

S

, picks two hash functions:

{H}_1:{\left\{0,1\right\}}^{\ast}\to {G}_1

and

{H}_2:{\left\{0,1\right\}}^{\ast}\to {Z}_p^{\ast }

, chooses

y\in {Z}_p^{\ast }

, computes

Y=\hat{e}{\left({g}_1,{g}_2\right)}^y

and selects

t_{i}

…”

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

“…Whether users or regulator, (

{\mathrm{sek}}_{\mathrm{DO}}

{\mathrm{loc}}_{\mathrm{DO}}

) is extremely critical information to decrypt and search DO's private data and judge the legality of content. For encrypting it over the attribute

\left\{{A}_j\right\}

, DO will use

{\delta}_{\mathrm{DO}}

and PK, and utilize ABPRE‐KS algorithm 31

\mathrm{AK}

to calculate

\begin{matrix} alignleft \\ align-1 C_{ori} & align-2 = AK . Enc (s e k_{DO}, {loc}_{DO}, PK) = {C_{key}, C_{loc}, C_{1}, C_{2}, C_{3, j}}, \\ align-1 C_{key} & align-2 = ({sek}_{DO}) \cdot Y^{δ_{DO}}, C_{loc} = ({loc}_{DO}) \cdot Y^{δ_{DO}}, \\ align-1 C_{1} & align-2 = g_{1}^{δ_{DO}}, C_{2} = g_{2}^{δ_{DO}}, C_{3, j} \end{matrix}

…”

Section: The Working Mechanism Of Dbsdsmentioning

confidence: 99%

See 3 more Smart Citations

DBSDS: A dual‐blockchain security data sharing model with supervision and privacy‐protection

Zhang

Luo

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

Blockchain Security Through SHA-512 Algorithm Implementation Using Python with NB-IoT Deployment in Food Supply Chain

Mohammed

Chopra

2023

Expert Clouds and Applications

View full text Add to dashboard Cite

Hybrid Lightweight Proxy Re-Encryption Scheme for Secure Fog-to-Things Environment

Khashan

2020

IEEE Access

View full text Add to dashboard Cite

Fog computing is a promising paradigm that can mitigate the heavy burden on cloud-central processing of the vast amount of IoT data. Although fog computing has the advantages of low latency, storage, and computing resources that serve IoT applications and things, it hardly suffers from security and privacy challenges. Proxy re-encryption (PRE) is an effective cryptographic solution to ensure the security of fog-to-things communication. However, in PRE schemes, the problem of a processing delay caused by offloading significant computational load to the proxy for re-encryption, and the heavy computation operations of data owner encryption and user decryption due to asymmetric cryptographic use, are still unresolved in the literature. In this paper, we propose a hybrid proxy re-encryption scheme that combines lightweight symmetric and asymmetric encryption algorithms to establish secure communications in fogto-things computing. In the proposed scheme, the computational cost incurred by fog nodes to carry out the re-encryption process is highly efficient. Meanwhile, the scheme can reduce the encryption and decryption overheads for end-users with resource-constrained devices. Security and performance analyses are conducted, and the results indicate that our scheme is secure, highly efficient, and lightweight.

show abstract

Towards secure data sharing in cloud computing using attribute based proxy re-encryption with keyword search

Cited by 8 publications

References 20 publications

DBSDS: A dual‐blockchain security data sharing model with supervision and privacy‐protection

DBSDS: A dual‐blockchain security data sharing model with supervision and privacy‐protection

Blockchain Security Through SHA-512 Algorithm Implementation Using Python with NB-IoT Deployment in Food Supply Chain

Hybrid Lightweight Proxy Re-Encryption Scheme for Secure Fog-to-Things Environment

Contact Info

Product

Resources

About