A Secure Public-Key Authentication Scheme

Min Liang, Li Yang

Public-key cryptosystems for quantum messages are considered from two aspects: public-key encryption and public-key authentication. Firstly, we propose a general construction of quantum public-key encryption scheme, and then construct an information-theoretic secure instance. Then, we propose a quantum public-key authentication scheme, which can protect the integrity of quantum messages. This scheme can both encrypt and authenticate quantum messages. It is information-theoretic secure with regard to encryption, and the success probability of tampering decreases exponentially with the security parameter with regard to authentication. Compared with classical public-key cryptosystems, one private-key in our schemes corresponds to an exponential number of public-keys, and every quantum public-key used by the sender is an unknown quantum state to the sender.

Colin Boyd, Anish Mathuria

Colin Boyd, Anish Mathuria, Douglas Stebila

Mengbo Hou, Qiuliang Xu

As the fundamental building block for secure communication in the open network, authenticated key agreement protocols are usually constructed in the public key setting. Certificateless public key cryptography combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In this paper, we present a secure and efficient two-party authenticated key agreement protocol based on the efficient certificateless public key encryption scheme due to Cheng and Comley. Security analysis shows that it achieves perfect forward secrecy, PKG forward secrecy and almost all the other known security attributes for authenticated key agreement protocol, such as known-key secrecy, key-compromise impersonation resilience, unknown key-share resilience, known session-specific temporary information security, message independence and no key control. Compared to other comparable schemes, it is more secure and has nice efficiency.

Lawrence M. Ioannou, Michele Mosca

Ziyuan Liu, Yi‐Fan Tseng, Raylin Tso +2 more

With the rapid development of cloud computing, an increasing number of companies are adopting cloud storage technology to reduce overhead. However, to ensure the privacy of sensitive data, the uploaded data need to be encrypted before being outsourced to the cloud. The concept of public-key encryption with keyword search (PEKS) was introduced by Boneh et al. to provide flexible usage of the encrypted data. Unfortunately, most of the PEKS schemes are not secure against inside keyword guessing attacks (IKGA), so the keyword information of the trapdoor may be leaked to the adversary. To solve this issue, Huang and Li presented public key authenticated encryption with keyword search (PAEKS) in which the trapdoor generated by the receiver is only valid for authenticated ciphertexts. With their seminal work, many PAEKS schemes have been introduced for the enhanced security of PAEKS. Some of them further consider the upcoming quantum attacks. However, our cryptanalysis indicated that in fact, these schemes could not withstand IKGA. To fight against the attacks from quantum adversaries and support the privacy-preserving search functionality, we first introduce a novel generic PAEKS construction in this work. Then, we further present the first quantum-resistant PAEKS instantiation based on lattices. The security proofs show that our instantiation not only satisfies the basic requirements but also achieves enhanced security models, namely the multi-ciphertext indistinguishability and multi-trapdoor privacy. Furthermore, the comparative results indicate that with only some additional expenditure, the proposed instantiation provides more secure properties, making it suitable for more diverse application environments.