Formal methods for quantum cryptography

Yi Liu, Xingtong Liu, Jian Wang +2 more

Electronic payment protocols play a vital role in electronic commerce to ensure the security of transaction process. Current electronic payment protocols based on complex mathematical problems will be vulnerable facing a quantum computer. In order to enhance the security against quantum computers, quantum cryptography is introduced into electronic payment protocols. Although the quantum cryptography is claimed to be unconditionally secure, Logical defects are still likely to cause serious problems. We introduced formal analysis to verify the security of electronic payment protocols based on quantum cryptography. Formal analysis methods can discover the vulnerabilities of protocols and help to improve the security of protocols. In this paper, we analyze an electronic payment protocol based on quantum cryptography and the result shows that the protocol is not secure even adopting unconditionally secure quantum cryptography. We found that both the accountability and fairness of the original protocol are not satisfied. Then we proposed an improved protocol to meet the requirement of accountability and fairness and verified it through formal analysis method.

Ellie D’Hondt

Fan Yang, Yu‐Jie Hao

The unconditional security is the most important identity of quantum cryptography protocols. Although has been proved, but the process is so complicated to realize. The formal verification method provides an effective way to analyze the security of the protocols, and also achieve the computer automated analysis.

Surasak Chiangga, Patrick Zarda, Thomas D. Jennewein +1 more

ARTUR K. EKERT

Jincheng Zhang

Quantum Information Cryptography (QIC) aims to secure information through cryptographic algorithms that are resistant to computational attacks. Traditional cryptographic approaches frequently rely on mathematical hardness assumptions, while geometric cryptography leverages the properties of geometric spaces to create secure systems. This paper explores a novel approach to QIC: the geometric formalization of key decryption. We propose a method that transforms the core decryption problem into a geometric problem, employing a novel optimization algorithm to refine cryptographic parameters and enhance security. The core claim is that this geometric formalization significantly improves the security of key decryption compared to traditional methods, leveraging the power of geometric topology. This work introduces a new framework for analyzing and optimizing cryptographic systems, potentially offering a more robust approach to secure communication.