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

Unconditionally-Secure and Reusable Public-Key Authentication

Lawrence M. Ioannou, Michele Mosca

Published Jan 1, 2014• 2 citations
Publisher
DOI
10.1007/978-3-642-54429-3_8

Related papers

A Framework for Unconditionally Secure Public-Key Encryption (with Possible Decryption Errors)

Mariya Bessonov, Dima Yu. Grigoriev, Vladimir Shpilrain

Lecture notes in computer science•Jan 1, 2018•1 citation

Unconditionally-secure and reusable public-key authentication

Lawrence M. Ioannou, Michele Mosca

We present a quantum-public-key identification protocol and show that it is secure against a computationally-unbounded adversary. This demonstrates for the first time that unconditionally-secure and reusable public-key authentication is possible in principle with (pure-state) public keys.

arXiv:1108.2887•Aug 14, 2011•1 citation

A Secure Public-Key Authentication Scheme

Zvi Galil, Stuart Haber, Moti M. Yung

Springer eBooks•Nov 15, 2007•0 citations

Public-key cryptography based on bounded quantum reference frames

Lawrence M. Ioannou, Michele Mosca

We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-verifier assumption. Thus, we also demonstrate that secure reusable quantum-public-key authentication is possible to some extent.

arXiv:0903.5156•Mar 30, 2009•6 citations

Adaptively-Secure, Non-interactive Public-Key Encryption

Ran Canetti, Shai Halevi, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2005•69 citations

A Lightweight Key Agreement Protocol with Authentication Capability

Albert Guan

Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).

International Journal of Foundations of Computer Science•Mar 16, 2021•0 citations
We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-verifier assumption. Thus, we also demonstrate that secure reusable quantum-public-key authentication is possible to some extent.
Computationally lightweight and unconditionally secure key agreement protocols are very useful for secure communication in public networks. Recently, Guan et al. proposed a key agreement protocol whose security is based on the unpredictability of channel noise rather than computationally hard problems. These protocols are efficient, computationally lightweight, and unconditionally secure. However, authentication was not integrated into these protocols. In this article, we propose a new protocol with authentication capability that enables two nodes in the network to establish a secret session key for secure communication. It is more efficient, and it also preserves the lightweight and unconditional secure features of the key agreement protocols proposed by Guan et al. Therefore, it is more suitable for devices with limited computing power, such as sensors in Internet of Things (IoT).