Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

Cheng, Gong; Juan, Du; Dong, Zhaoyang; Guo, Zhenzhou; Gani, Abdullah; Zhao, Liang; Qi, Han

doi:10.1007/s11128-020-2603-0

Cited by 29 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2020, Gong et al 19 proposed a new QHECR method based upon Grover algorithm for solving the issue of cipher text data retrieval in quantum CC using homomorphic encryption. This method was to develop such retrieval effectiveness said above wherein; the communication procedure is not necessary even if T‐gate subsisted in the circuit.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Novel quantum key distribution and attribute based encryption for cloud data security

Verma

Kumar

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryImprovement of privacy and security in data centers is challenging with proficient safety key managing. So as to resolve this issue, data centers require proficient quantum cryptographic techniques with authentication methods that are suitable to improve the privacy and security with lesser intricacy. In addition, quantum cryptography (QC) offers maximal security with lesser complication, which raises the security strength and storing capability of big data. This work intends to introduce a QC oriented data security model in cloud via electing the optimal private key. Here, attribute based encryption (ABE) is performed for ensuring better data transmission among the nodes in cloud. For key generation in ABE, improved QKD is adopted in this work. Depending upon this, the decryption and encryption is done. Moreover, for optimal secret key selection in ABE, self‐modified Aquila optimization (SM‐AO) scheme is deployed. Further, analysis is done depending upon varied metrics.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…Table 1 show the review on conventional QC oriented cloud data security. At first, Grover algorithm was introduced in Reference 19, which presented improved reliability with low complexity. However, it has to focus more on UAV communication.…”

Section: Literature Reviewmentioning

confidence: 99%

Novel quantum key distribution and attribute based encryption for cloud data security

Verma

Kumar

2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Like many QHE schemes [17][18][19]22,24], this paper combines X and Z to encrypt the plaintext qubit |φ〉.…”

Section: Preliminaries 21 Quantum Computationmentioning

confidence: 99%

“…If only X and Z are executed on the evaluation result, they cannot be completely obtained T|φ〉, and there may be a S-error. In order to eliminate S-error, based on the idea of U-rotated Bell measurement, Gong et al [24] designed the quantum circuit shown in Fig. 1 to complete the homomorphic evaluation process of T-gate.…”

Section: Preliminaries 21 Quantum Computationmentioning

confidence: 99%

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Xu¹,

Fan²,

Chen³

et al. 2022

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants' secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant's attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.

show abstract

“…But, data security is a crucial issue, because of the severe susceptibility and hitch in cloud storage [9,10]. In conventional approaches, encrypting data before transmitting and saving it as ciphertext in the cloud is an extensively applied approach for performing data privacy protection [11,12,13]. Conventional cryptographic cloud storage needs the management of a huge amount of keys.…”

Section: Introductionmentioning

confidence: 99%

Effective Quantum Key Distribution Using Modified Key Sifting Scheme for Cloud Storage Security

2023

IJIES

View full text Add to dashboard Cite

Cloud storage has gained extensive attention due to its low cost, global scalability, and improved agility. Data privacy is an important issue in cloud storage because breaches of personal information or business secrets are occurred by malicious hackers or unauthorized cloud operators. To address this issue, a Modified Key Sifting Scheme (MKSS) is proposed for developing an effective Quantum Key Distribution (QKD) with Two-Way Identity Authentication (TWIA) to provide security in the cloud storage. The Tree Parity Machine (TPM) is used for proposing a MKSS which used to minimize the key distribution time based on the synchronization. This MKSS-QKDTWIA considers four different objects such as data user, data owner, server and data storage in a communication scenario. The performance of the MKSS-QKDTWIA is analyzed by means of key computation time, processing time, encryption & decryption time, and memory utilization. Existing research such as Modified Random Fibonacci Cryptographic (MRFC), Software Stack-QKD (SS-QKD) and Enhanced Cloud Security Model based on QKD Protocol (ECSM-QKDP) are used to evaluate the performance of MKSS-QKDTWIA. The key computation time of MKSS-QKDTWIA for 50 attribute sets in each key is 16.7s which is less when compared to the MRFC, SS-QKD and ECSM-QKDP.

show abstract

Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

Cited by 29 publications

References 21 publications

Novel quantum key distribution and attribute based encryption for cloud data security

Novel quantum key distribution and attribute based encryption for cloud data security

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Effective Quantum Key Distribution Using Modified Key Sifting Scheme for Cloud Storage Security

Contact Info

Product

Resources

About