Password-based authenticated key exchange (PAKE) allows participants sharing low-entropy passwords to agree on cryptographically strong session keys over insecure networks. In this paper, we present two PAKE protocols from lattices in the two-party and three-party settings, respectively, which can resist quantum attacks and achieve mutual authentication. The protocols in this paper achieve two rounds of communication by carefully utilizing the splittable properties of the underlying primitive, a CCA (Chosen-Ciphertext Attack)-secure public key encryption (PKE) scheme with associated nonadaptive approximate smooth projection hash (NA-ASPH) system. Compared with other related protocols, the proposed two-round PAKE protocols have relatively less communication and computation overhead. In particular, the two-round 3PAKE is more practical in large-scale communication systems.
Password-based authenticated key exchange (PAKE) allows participants sharing low-entropy passwords to agree on cryptographically strong session keys over insecure networks. In this paper, we present two PAKE protocols from lattices in the two-party and three-party settings, respectively, which can resist quantum attacks and achieve mutual authentication. The protocols in this paper achieve two rounds of communication by carefully utilizing the splittable properties of the underlying primitive, a CCA (Chosen-Ciphertext Attack)-secure public key encryption (PKE) scheme with associated nonadaptive approximate smooth projection hash (NA-ASPH) system. Compared with other related protocols, the proposed two-round PAKE protocols have relatively less communication and computation overhead. In particular, the two-round 3PAKE is more practical in large-scale communication systems.
An approximate smooth projective hash(ASPH) function is an important primitive of the lattice-based cryptography,and it is used to construct password-based authenticated key exchange(PAKE) protocol which is resistant to quantum attacks by Katz et al.The available ASPH function based on the hardness of the standard lattice problem has a large key size and impractical implementations.Based on learning with error problem from ideal lattices(R-LWE),this paper designs a new public-key encryption scheme and an associated ASPH function that can apply to PAKE protocol,and gives a proof of its security.Compared with the existing system,the new system has a small key size,fast computing speed and high efficiency.
The Password-Authenticated Key Exchange (PAKE) protocol is a useful tool for establishing secure remote communication between users, especially given the prevalence of amplifying a human-memorable password into a strong session key in the age of hand-held devices. Recent advances in quantum computing have stimulated interest in quantum-safe cryptographic schemes. Therefore, we propose QSPAK and QSPPK, two post-quantum and efficient PAKE protocols which are parallel extensions of PAK and PPK, but based on the hardness assumption over module lattices. Specifically, we make a comprehensive trade-off among multiple significant performance indicators such as the post-quantum security, the failure rate, the communication cost and the running time to guide optimal parameter choices. This rigorous instantiation has never been seen in previous PAKE papers. Additionally, utilizing the flexibility of module lattices, we provide three parameter sets (#1, #2, and #3) matching different security scenarios. We implement and benchmark QSPAK and QSPPK against other competitive proposals. The performance results indicate that our QSPAK and QSPPK, besides being more efficient, exhibit the flexibility and security advantages over the latter schemes. Furthermore, we construct a post-quantum password-authenticated TLS 1.3 framework, aimed towards provide a further suggestion for IETF standardization of quantum-safe PAKE.
Stronger anonymity password authentication key exchange protocols based on traditional cryptography are not resistant to quantum computing attacks, and there is no lattice-only anonymous password authentication key exchange protocol protocol that satisfies the strong anonymity requirement. Therefore, this paper constructs stronger anonymity PAKE protocol based on the ring learning with errors (RLWE) and smooth projective hash function (SPHF) based on ideal lattice. The proposed protocol can achieve stronger anonymity and resists to desynchronization attacks and quantum attack. The security of the protocol is proved under the BPR model. The security and performance analysis shows that the proposed PAKE protocol has better advantages in security and efficiency.
As the security of password authenticated key exchange protocols based on traditional public key cryptosystems is threatened by quantum computing, the research on password authenticated key exchange protocols that can resist quantum computing attacks has become a hot spot of current research. At present, the anonymity of anonymous PAKE protocol is generally linkable, and cannot completely protect the user’s identity privacy information. This paper proposes a two-party password authenticated key exchange protocol with anonymity based on SPHF from ideal lattice, and gives a strict security proofunder the BPR model. The security and performance analysis proves that the proposed protocol has good advantages in communication costs and security.
In this paper, we study Password Authenticated Key Exchange (PAKE) in a group. First, we present a generic "fairy-ring dance" construction that transforms any secure two-party PAKE scheme to a group PAKE protocol while preserving the round efficiency in the optimal way. Based on this generic construction, we present two concrete instantiations based on using SPEKE and J-PAKE as the underlying PAKE primitives respectively. The first protocol, called SPEKE+, accomplishes authenticated key exchange in a group with explicit key confirmation in just two rounds. This is more round-efficient than any existing group PAKE protocols in the literature. The second protocol, called J-PAKE+, requires one more round than SPEKE+, but is computationally faster. Finally, we present full implementations of SPEKE+ and J-PAKE+ with detailed performance measurements. Our experiments suggest that both protocols are feasible for practical applications in which the group size may vary from three to several dozen. This makes them useful, as we believe, for a wide range of applications - e.g., to bootstrap secure communication among a group of smart devices in the Internet of Things (IoT).
In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.