An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof

This paper investigated the Bitcoin blockchain and other crypto currencies confidential transaction techniques for cryptographic commitment in a zero-knowledge proof system. A cryptocurrency transaction on a blockchain contains information about the sender and the receiver transaction is public. Therefore, in order to handle our sensitive data like transaction amounts should be hidden. In this paper, we study a new novel quantum non-interactive zero-knowledge proof (QNIZK) for Quantum Range Proof (QRP). Our design of both components improves the efficiency and quantum circuit without requiring a trusted setup over prior work. Since quantum range proof is more efficient in performing q-bit measurements and explains the algorithm as well as quantum state measurement. Quantum Range Proof requires an inner product in Hilbert complex vector space to measure wave function |ψ├⟩┤ in two different quantum states |0├⟩ or ┤ |1├⟩┤ for the verifier. Thus, proving the commitment value is in the range [0 ≤ k-1], we also describe witness is measured in terms of different quantum states in non-polynomial space complexity is 0√N verification time, if the quantum circuit is unstructured search. A typical experiment shows the verification time in milliseconds for the generation of Proof for Quantum Circuits in computing.