Abstract

Quantum computing is no longer a thing of the future. Shor’s algorithm proved that a quantum computer couldtraverse key of factoring problems in polynomial time. Because the time-complexity of the exhaustive keysearch for quantum computing has not reliably exceeded the reasonable expiry of crypto key validity, it is believedthat current cryptography systems built on top of computational security are not quantum-safe. Quantumkey distribution fundamentally solves the problem of eavesdropping; nevertheless, it requires quantumpreparatory work and quantum-network infrastructure, and these remain unrealistic with classical computers.In transitioning to a mature quantum world, developing a quantum-resistant mechanism becomes a stringentproblem. In this research, we innovatively tackled this challenge using a non-computational difficulty schemewith zero-knowledge proof in order to achieve repellency against quantum computing cryptanalysis attacks foruniversal classical clients.

Highlights

  • Computing can occur in any location and using a wide range of devices

  • With several rounds of dummy test execution generated by cloud service consumers, we can observe that the scope for a cloud service provider is merely executing massive instructions on the operation result in ciphertext with pre-defined Fully Homomorphic Encryption (FHE) evaluate algorithm of Zero-Knowledge Proof (ZKP)-Cave

  • In the case of a malicious adversary/ service provider armed with quantum computing power, since there is no key-exchange during ZKP-Cave protocol, there is no PKI computational vulnerability that can be breached by quantum computation

Read more

Summary

Introduction

Computing can occur in any location and using a wide range of devices. The path to this accomplishment has passed through mainframe and personal computing, and to Internet computing. 2021/2/50 approach to information security depends heavily on public key cryptography systems of computational security, where the security commitment comes from the time required for exhaustive key search exceeding that required for cryptography key validity, and the attacking resource cost outweighs the value of the message itself. Owning a private quantum computer is unrealistic, attackers can leverage quantum computing services from cloud providers with quantum supremacy to conduct cryptanalysis attacks. It is imperative to identify different approaches to classical cryptography algorithms, which are known as Post-Quantum Cryptographies (PQC)

Paper Organization and Contributions
Quantum Cryptography
Previous Quantum Resistance Research
Proof System for Authentication
Proposed Scheme
Pseudo-code of Two ZKP-Cave Algorithms
Incorporate with Improved Fully Homomorphic Symmetric Encryption
Test and Evaluation
Scheme Effectiveness Simulation
Discussions
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call