Post-Quantum Authentication Schemes

Author(s):  
Mark A. Mendiola ◽  
James. T. Gillis ◽  
Andrew J. Binder ◽  
Ranwa Haddad
2019 ◽  
Vol 19 (11&12) ◽  
pp. 913-934
Author(s):  
Daan Leermakers ◽  
Boris Skoric

Quantum Key Recycling aims to re-use the keys employed in quantum encryption and quantum authentication schemes. QKR protocols can achieve better round complexity than Quantum Key Distribution. We consider a QKR protocol that works with qubits, as opposed to high-dimensional qudits. A security proof was given by Fehr and Salvail in the case where there is practically no noise. A high-rate scheme for the noisy case was proposed by \v{S}kori\'{c} and de Vries, based on eight-state encoding. However, a security proof was not given. In this paper we introduce a protocol modification and provide a security proof. The modified protocol has high rate not only for 8-state encoding, but also 6-state and BB84 encoding. Our proof is based on a bound on the trace distance between the real quantum state of the system and a state in which the keys are completely secure. It turns out that the rate is higher than suggested by previous results. Asymptotically the rate equals the rate of Quantum Key Distribution with one-way postprocessing.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Riseul Ryu ◽  
Soonja Yeom ◽  
Soo-Hyung Kim ◽  
David Herbert

2010 ◽  
Vol 143-144 ◽  
pp. 915-919
Author(s):  
Yung Cheng Lee

The well-known password authentication mechanisms are widely used in networks to protect resources from unauthorized access. The ad hoc networks, due to their dynamic and lack of network infrastructure features, require authentication schemes to ensure security. In this paper, we propose a new threshold password authentication scheme for ad hoc networks. Our scheme can be efficiently implemented in mobile devices, and can achieve mutual authentication with registered users.


2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Younsung Choi ◽  
Junghyun Nam ◽  
Donghoon Lee ◽  
Jiye Kim ◽  
Jaewook Jung ◽  
...  

An anonymous user authentication scheme allows a user, who wants to access a remote application server, to achieve mutual authentication and session key establishment with the server in an anonymous manner. To enhance the security of such authentication schemes, recent researches combined user’s biometrics with a password. However, these authentication schemes are designed for single server environment. So when a user wants to access different application servers, the user has to register many times. To solve this problem, Chuang and Chen proposed an anonymous multiserver authenticated key agreement scheme using smart cards together with passwords and biometrics. Chuang and Chen claimed that their scheme not only supports multiple servers but also achieves various security requirements. However, we show that this scheme is vulnerable to a masquerade attack, a smart card attack, a user impersonation attack, and a DoS attack and does not achieve perfect forward secrecy. We also propose a security enhanced anonymous multiserver authenticated key agreement scheme which addresses all the weaknesses identified in Chuang and Chen’s scheme.


Sign in / Sign up

Export Citation Format

Share Document