scholarly journals Non-Invertible Public Key Certificates

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 226
Author(s):  
Luis Adrián Lizama-Perez ◽  
J. Mauricio López R.
Keyword(s):  
Public Key Infrastructure ◽  
Key Exchange ◽  
Public Key ◽  
Key Exchange Protocol ◽  
Forward Secrecy ◽  
Certification System ◽  
Perfect Forward Secrecy

Post-quantum public cryptosystems introduced so far do not define a scalable public key infrastructure for the quantum era. We demonstrate here a public certification system based on Lizama’s non-invertible key exchange protocol which can be used to implement a secure, scalable, interoperable and efficient public key infrastructure (PKI). We show functionality of certificates across different certification domains. Finally, we discuss a method that enables non-invertible certificates to exhibit perfect forward secrecy (PFS).

scholarly journals Non-invertible Public Key Certificates

2020 ◽  
Author(s):  
Luis Lizama-Pérez ◽  
J. Mauricio López
Keyword(s):  
Public Key Infrastructure ◽  
Key Exchange ◽  
Public Key ◽  
Key Exchange Protocol ◽  
Forward Secrecy ◽  
Certification System ◽  
Perfect Forward Secrecy

Post-quantum public cryptosystems introduced so far do not define an scalable public key infrastructure for the quantum era. We demonstrate here a public certification system based in Lizama’s non-invertible Key Exchange Protocol which can be used to implement a public key infrastructure (PKI), secure, scalable, interoperable and efficient. We show functionality of certificates across different certification domains. Finally, we discuss that non-invertible certificates can exhibit Perfect Forward Secrecy (PFS).

scholarly journals A Provably Secure Revocable ID-Based Authenticated Group Key Exchange Protocol with Identifying Malicious Participants

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Tsu-Yang Wu ◽  
Tung-Tso Tsai ◽  
Yuh-Min Tseng
Keyword(s):  
Key Exchange ◽  
Public Key ◽  
Key Exchange Protocol ◽  
Forward Secrecy ◽  
Group Key ◽  
Computation Technique ◽  
Group Key Exchange ◽  
Security Properties ◽  
Authenticated Group Key ◽  
Provably Secure

The existence of malicious participants is a major threat for authenticated group key exchange (AGKE) protocols. Typically, there are two detecting ways (passive and active) to resist malicious participants in AGKE protocols. In 2012, the revocable identity- (ID-) based public key system (R-IDPKS) was proposed to solve the revocation problem in the ID-based public key system (IDPKS). Afterwards, based on the R-IDPKS, Wu et al. proposed a revocable ID-based AGKE (RID-AGKE) protocol, which adopted a passive detecting way to resist malicious participants. However, it needs three rounds and cannot identify malicious participants. In this paper, we fuse a noninteractive confirmed computation technique to propose the first two-round RID-AGKE protocol with identifying malicious participants, which is an active detecting way. We demonstrate that our protocol is a provably secure AGKE protocol with forward secrecy and can identify malicious participants. When compared with the recently proposed ID/RID-AGKE protocols, our protocol possesses better performance and more robust security properties.

Perfect Forward Secrecy of Authentication and Key Exchange Protocols in Three Versions of WAPI

2007 ◽  
Vol 6 (7) ◽  
pp. 1108-1113 ◽  
Author(s):  
Chun-Jie Cao ◽  
Chao Yang ◽  
Xing-Hua Li ◽  
Yuan Bo Guo ◽  
Jian Feng Ma
Keyword(s):  
Key Exchange ◽  
Forward Secrecy ◽  
Key Exchange Protocols ◽  
Perfect Forward Secrecy

scholarly journals Non-Commutative Key Exchange Protocol

2021 ◽  
Author(s):  
Luis Adrián Lizama-Pérez ◽  
José Mauricio López Romero
Keyword(s):  
Discrete Logarithm ◽  
Matrix Multiplication ◽  
Key Exchange ◽  
Security Level ◽  
Search Problem ◽  
Key Exchange Protocol ◽  
Secret Communication ◽  
Perfect Forward Secrecy ◽  
Iot Devices ◽  
Commutative Matrix

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{Z}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We claim that the unique eavesdropper's opportunity to get the secret/private key is by means of an exhaustive search which is equivalent to the unsorted database search problem. Furthermore, we show that the secret/private keys become indistinguishable to the eavesdropper. Remarkably, to achieve a 512-bit security level, the keys (public/private) are of the same size when matrix multiplication is done over a reduced 8-bit size modulo. Also, we discuss how to achieve key certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.

Sign in / Sign up

Export Citation Format

Share Document