Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Two-Message Key Exchange with Strong Security from Ideal Lattices

Zheng Yang, Yu Chen, Song Luo

Published Jan 1, 2018• 6 citations
Publisher
DOI
10.1007/978-3-319-76953-0_6

Related papers

Strongly Secure Authenticated Key Exchange from Ideal Lattices.

Xiaopeng Yang, Wenping Ma

•Jan 1, 2015•1 citation

A Strongly Secure Lattice-Based Key Exchange Protocol

Weiqiang Wen, Wang Li-bin

Journal of Computer Research and Development•Oct 1, 2015•1 citation

Strongly secure authenticated key exchange from factoring, codes, and lattices

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa +1 more

Designs Codes and Cryptography•Apr 22, 2014•46 citations

Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa +1 more

Lecture notes in computer science•Jan 1, 2012•93 citations

An Analysis of Lattice-Based Key Exchange Protocols

Susanne Rieß

•Feb 1, 2016•0 citations

Universally Composable Authentication and Key-exchange with Global PKI

Ran Canetti, Daniel Shahaf, Margarita Vald

Message authentication and key exchange are two of the most basic tasks of cryptography. Solutions based on public-key infrastructure (PKI) are prevalent. Still, the state of the art in composable security analysis of PKI-based authentication and key exchange is somewhat unsatisfactory. Specifically, existing treatments either (a) make the unrealistic assumption that the PKI is accessible only within the confines of the protocol itself, thus failing to capture real-world PKI-based authentication, or (b) impose oftenunnecessary requirements—such as strong on-line non-transferability—on candidate protocols, thus ruling out natural candidates. We give a modular and universally composable analytical framework for PKI-based message authentication and key exchange protocols. This framework guarantees security even when the PKI is pre-existing and globally available, without being unnecessarily restrictive. Specifically, we model PKI as a global set-up functionality within the Global UC security model [Canetti et al., TCC 2007] and relax the ideal authentication and key exchange functionalities accordingly. We then demonstrate the security of basic signature-based authentication and key exchange protocols. Our modeling makes minimal security assumptions on the PKI in use; in particular, “knowledge of the secret key” is not needed.

•Jan 1, 2014•2 citations
Message authentication and key exchange are two of the most basic tasks of cryptography. Solutions based on public-key infrastructure (PKI) are prevalent. Still, the state of the art in composable security analysis of PKI-based authentication and key exchange is somewhat unsatisfactory. Specifically, existing treatments either (a) make the unrealistic assumption that the PKI is accessible only within the confines of the protocol itself, thus failing to capture real-world PKI-based authentication, or (b) impose oftenunnecessary requirements—such as strong on-line non-transferability—on candidate protocols, thus ruling out natural candidates. We give a modular and universally composable analytical framework for PKI-based message authentication and key exchange protocols. This framework guarantees security even when the PKI is pre-existing and globally available, without being unnecessarily restrictive. Specifically, we model PKI as a global set-up functionality within the Global UC security model [Canetti et al., TCC 2007] and relax the ideal authentication and key exchange functionalities accordingly. We then demonstrate the security of basic signature-based authentication and key exchange protocols. Our modeling makes minimal security assumptions on the PKI in use; in particular, “knowledge of the secret key” is not needed.