Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Scientific Reports

A Quantum secure sharing protocol for Cloud data based on proxy re-encryption

Yan Zuo Chang, Shibin Zhang, Lili Yan, Guogen Wan

Published Jun 3, 2020• 4 citations
Publisher

Abstract

A quantum scheme for cloud data sharing based on proxy re-encryption is proposed. The user Alice stores the cipher-text of her data on cloud data center. When Alice wants to share her data with another user Bob, Alice is called the delegator and Bob is called the delegatee. The cloud service provider (called the proxy) can convert the delegator's cipher-text into the delegatee's cipher-text without decrypting the former, so that the delegatee can get the plain-text of Alice's data with his private key. The proxy cannot obtain the plain-text of the user's data stored on cloud data center. Delegator in the protocol should have the ability of producing Bell states, performing Bell basis and Z-basis measurements, and storing qubits. The quantum requirements for the delegatee are reduced. The delegatee needs to have the ability of reflecting and performing Z-basis measurement. One secret at a time (one-time one-pad) is theoretically implemented, especially when the same data is shared multiple times. The anti-selection plain-text attack security and the anti-selective cipher-text attack security are realized. Fine-granularity secret data sharing is achieved flexibly.

DOI
10.1038/s41598-020-65738-y

Related papers

CCA Secure Proxy Re-Encryption Scheme for Secure Sharing of Files through Cloud Storage

Bharati Mishra, Debasish Jena

Cloud Storage Service(CSS) provides unbounded, robust file storage capability and facilitates for pay-per-use and collaborative work to end users. But due to security issues like lack of confidentiality, malicious insiders, it has not gained wide spread acceptance to store sensitive information. Researchers have proposed proxy re-encryption schemes for secure data sharing through cloud. Due to advancement of computing technologies and advent of quantum computing algorithms, security of existing schemes can be compromised within seconds. Hence there is a need for designing security schemes which can be quantum computing resistant. In this paper, a secure file sharing scheme through cloud storage using proxy re-encryption technique has been proposed. The proposed scheme is proven to be chosen ciphertext secure(CCA) under hardness of ring-LWE, Search problem using random oracle model. The proposed scheme outperforms the existing CCA secure schemes in-terms of re-encryption time and decryption time for encrypted files which results in an efficient file sharing scheme through cloud storage.

International Conference on Emerging Applications of Information Technology•Jan 1, 2018•6 citations

Cloud server quantum data secret sharing scheme

Yan Chang, Honglin LIU, Zhijian Gou +4 more

Storing data in the form of quantum states on cloud servers can significantly enhance storage efficiency. The storage and sharing of quantum data on cloud servers necessitate consideration of security issues. An ingenious solution is to store data in the form of ciphertext on cloud servers. When data needs to be shared with users, the cloud server performs a second encryption on the data ciphertext and sends the doubly encrypted ciphertext to the users. Users can decrypt and obtain the data itself using their private keys. This process can be regarded as the transformation of the data owner’s ciphertext into a shared ciphertext by a third party (the cloud server). This study proposes a new quantum data sharing scheme for cloud servers. One of our main contributions is the realization of sharing specific data with users who have appropriate permissions (satisfying certain attribute-based conditions). The security of the scheme is demonstrated through key analysis, plaintext analysis, first-level ciphertext analysis, and second-level ciphertext analysis.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Mar 6, 2025•1 citation

Semantic keyword searchable proxy re‐encryption for postquantum secure cloud storage

Yang Yang, Xianghan Zheng, Victor I. C. Chang +1 more

Summary With the advent of cloud computing, more and more consumers prefer to use the cloud services with the pay‐as‐you‐consume mode. The cloud storage brings about great convenience to users, who store data in cloud and access to it using the smart devices anytime and anywhere. Consumers' information should be encrypted to guarantee the data privacy. Flexible searching on ciphertext is a critical challenge to be solved for effective data utilization. In this paper, we propose a novel semantic keyword searchable proxy re‐encryption scheme for secure cloud storage. A highlight of this work is that the scheme is quantum attack resistant, while most of the available searchable encryption schemes are not. It supports not only exact keyword search but also synonym keyword search. Moreover, the data owner is capable to delegate his search right to another user using the proxy re‐encryption mechanism. In the generation process of re‐encryption key, the delegator and delegatee do not need to be interactive with each other. The scheme is also collusion resistant. Under the learning with errors hardness problem, this scheme is proved secure in standard model.

Concurrency and Computation Practice and Experience•Jun 20, 2017•50 citations

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Jinqiu Hou, Changgen Peng, Weijie Tan +1 more

Cloud-based services have powerful storage functions and can provide accurate computation. However, the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight. Although the attribute-based proxy re-encryption (ABPRE) schemes based on number theory can solve this problem, it is still difficult to resist quantum attacks and have limited expression capabilities. To address these issues, we present a novel linear secret sharing schemes (LSSS) matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research. Additionally, to detect the activities of illegal proxies, homomorphic signature (HS) technology is introduced to realize the verifiability of re-encryption. Moreover, the non-interactivity, unidirectionality, proxy transparency, multi-use, and anti-quantum attack characteristics of our system are all advantageous. Besides, it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud. Furthermore, under the standard model, the proposed learning with errors (LWE)-based scheme was proven to be IND-sCPA secure.

Computer Modeling in Engineering & Sciences•Sep 19, 2023•5 citations

Inter-domain Identity-based Proxy Re-encryption

Qiang Tang, Pieter Hartel, Willem Jonker

Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). So far, research efforts have only been devoted to the intra-domain setting, where the delegator and the delegatee are registered in the same domain. In this paper, we investigate the proxy re-encryption in the inter-domain setting, where the delegator and the delegatee are from different domains, and focus on the identity-based case. We analyze the trust relationships and possible threats to the plaintext privacy, and provide rigorous security definitions. We propose a new inter-domain identity-based proxy re-encryption scheme and prove its security in our security model. An interesting property of the proposed scheme is that, to achieve the chosen plaintext security for the delegator, the delegatee’s IBE only needs to be one-way. 1

CTIT technical reports series•Apr 14, 2008•5 citations

Collusion-Resistant Identity-Based Proxy Re-Encryption Without Random Oracles

JunJie Qiu, Jungbok Jo, Hoon Jae Lee

In an identity-based proxy re-encryption scheme, a semi-trusted proxy can convert a ciphertext under Alice's public identity into a ciphertext for Bob.The proxy does not know the secret key of Alice or Bob, and also does not know the plaintext during the conversion.In identity-based proxy re-encryption, the collusion of the proxy and a delegatee may result in the decryption of ciphertext for delegator.In this paper, we present a new scheme which can avoid the collusion of proxy and delegatee.Our scheme improves the scheme of Chu and Tzeng while inheriting all useful properties such as unidirectionality and non-interactivity.In our scheme, we get the security by using added secret parameter and change the secret key and re-encryption key.Our sheme is secure against Chosen-Ciphertext Attack (CCA) and collusion attack in the standard model.

International Journal of Security and Its Applications•Sep 30, 2015•5 citations
A quantum scheme for cloud data sharing based on proxy re-encryption is proposed. The user Alice stores the cipher-text of her data on cloud data center. When Alice wants to share her data with another user Bob, Alice is called the delegator and Bob is called the delegatee. The cloud service provider (called the proxy) can convert the delegator's cipher-text into the delegatee's cipher-text without decrypting the former, so that the delegatee can get the plain-text of Alice's data with his private key. The proxy cannot obtain the plain-text of the user's data stored on cloud data center. Delegator in the protocol should have the ability of producing Bell states, performing Bell basis and Z-basis measurements, and storing qubits. The quantum requirements for the delegatee are reduced. The delegatee needs to have the ability of reflecting and performing Z-basis measurement. One secret at a time (one-time one-pad) is theoretically implemented, especially when the same data is shared multiple times. The anti-selection plain-text attack security and the anti-selective cipher-text attack security are realized. Fine-granularity secret data sharing is achieved flexibly.
Cloud Storage Service(CSS) provides unbounded, robust file storage capability and facilitates for pay-per-use and collaborative work to end users. But due to security issues like lack of confidentiality, malicious insiders, it has not gained wide spread acceptance to store sensitive information. Researchers have proposed proxy re-encryption schemes for secure data sharing through cloud. Due to advancement of computing technologies and advent of quantum computing algorithms, security of existing schemes can be compromised within seconds. Hence there is a need for designing security schemes which can be quantum computing resistant. In this paper, a secure file sharing scheme through cloud storage using proxy re-encryption technique has been proposed. The proposed scheme is proven to be chosen ciphertext secure(CCA) under hardness of ring-LWE, Search problem using random oracle model. The proposed scheme outperforms the existing CCA secure schemes in-terms of re-encryption time and decryption time for encrypted files which results in an efficient file sharing scheme through cloud storage.
Storing data in the form of quantum states on cloud servers can significantly enhance storage efficiency. The storage and sharing of quantum data on cloud servers necessitate consideration of security issues. An ingenious solution is to store data in the form of ciphertext on cloud servers. When data needs to be shared with users, the cloud server performs a second encryption on the data ciphertext and sends the doubly encrypted ciphertext to the users. Users can decrypt and obtain the data itself using their private keys. This process can be regarded as the transformation of the data owner’s ciphertext into a shared ciphertext by a third party (the cloud server). This study proposes a new quantum data sharing scheme for cloud servers. One of our main contributions is the realization of sharing specific data with users who have appropriate permissions (satisfying certain attribute-based conditions). The security of the scheme is demonstrated through key analysis, plaintext analysis, first-level ciphertext analysis, and second-level ciphertext analysis.
Summary With the advent of cloud computing, more and more consumers prefer to use the cloud services with the pay‐as‐you‐consume mode. The cloud storage brings about great convenience to users, who store data in cloud and access to it using the smart devices anytime and anywhere. Consumers' information should be encrypted to guarantee the data privacy. Flexible searching on ciphertext is a critical challenge to be solved for effective data utilization. In this paper, we propose a novel semantic keyword searchable proxy re‐encryption scheme for secure cloud storage. A highlight of this work is that the scheme is quantum attack resistant, while most of the available searchable encryption schemes are not. It supports not only exact keyword search but also synonym keyword search. Moreover, the data owner is capable to delegate his search right to another user using the proxy re‐encryption mechanism. In the generation process of re‐encryption key, the delegator and delegatee do not need to be interactive with each other. The scheme is also collusion resistant. Under the learning with errors hardness problem, this scheme is proved secure in standard model.
Cloud-based services have powerful storage functions and can provide accurate computation. However, the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight. Although the attribute-based proxy re-encryption (ABPRE) schemes based on number theory can solve this problem, it is still difficult to resist quantum attacks and have limited expression capabilities. To address these issues, we present a novel linear secret sharing schemes (LSSS) matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research. Additionally, to detect the activities of illegal proxies, homomorphic signature (HS) technology is introduced to realize the verifiability of re-encryption. Moreover, the non-interactivity, unidirectionality, proxy transparency, multi-use, and anti-quantum attack characteristics of our system are all advantageous. Besides, it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud. Furthermore, under the standard model, the proposed learning with errors (LWE)-based scheme was proven to be IND-sCPA secure.
Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). So far, research efforts have only been devoted to the intra-domain setting, where the delegator and the delegatee are registered in the same domain. In this paper, we investigate the proxy re-encryption in the inter-domain setting, where the delegator and the delegatee are from different domains, and focus on the identity-based case. We analyze the trust relationships and possible threats to the plaintext privacy, and provide rigorous security definitions. We propose a new inter-domain identity-based proxy re-encryption scheme and prove its security in our security model. An interesting property of the proposed scheme is that, to achieve the chosen plaintext security for the delegator, the delegatee’s IBE only needs to be one-way. 1
In an identity-based proxy re-encryption scheme, a semi-trusted proxy can convert a ciphertext under Alice's public identity into a ciphertext for Bob.The proxy does not know the secret key of Alice or Bob, and also does not know the plaintext during the conversion.In identity-based proxy re-encryption, the collusion of the proxy and a delegatee may result in the decryption of ciphertext for delegator.In this paper, we present a new scheme which can avoid the collusion of proxy and delegatee.Our scheme improves the scheme of Chu and Tzeng while inheriting all useful properties such as unidirectionality and non-interactivity.In our scheme, we get the security by using added secret parameter and change the secret key and re-encryption key.Our sheme is secure against Chosen-Ciphertext Attack (CCA) and collusion attack in the standard model.