Security and Communication Networks

Generic Construction of Forward-Secure Revocable Identity-Based Signature and Lattice-Based Instantiations

Yan He, Baodong Qin, Wen Gao, Dong Zheng, Zhao Qianqian

Published Nov 16, 2022• 1 citation

Abstract

Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks. However, known forward-secure revocable identity-based signature (FS-RIBS) schemes were designed over bilinear pairing groups and may suffer from quantum computing attacks. To address this issue, this paper proposes a generic method to construct FS-RIBS schemes, taking (hierarchical) IBS schemes as a basic component. By instantiating it with some post-quantum (hierarchical) IBS schemes, e.g., lattice-based (hierarchical) IBS, we immediately obtain six FS-RIBS schemes under the hardness of the small integer solution problem, which is secure against quantum computing attacks.

DOI: 10.1155/2022/7494452

Related papers

Scalable Revocable Identity-Based Signature Scheme with Signing Key Exposure Resistance from Lattices

Congge Xie, Jian Weng, Jinming Wen

In 2014, a new security definition of a revocable identity-based signature (RIBS) with signing key exposure resistance was introduced. Based on this new definition, many scalable RIBS schemes with signing key exposure resistance were proposed. However, the security of these schemes is based on traditional complexity assumption, which is not secure against attacks in the quantum era. Lattice-based cryptography has many attractive features, and it is believed to be secure against quantum computing attacks. We reviewed existing lattice-based RIBS schemes and found that all these schemes are vulnerable to signing key exposure. Hence, in this paper, we propose the first lattice-based RIBS scheme with signing key exposure resistance by using the left-right lattices and delegation technology. In addition, we employ a complete subtree revocation method to ensure our construction meeting scalability. Finally, we prove that our RIBS scheme is selective-ID existentially unforgeable against chosen message attacks (EUF-sID-CMA) under the standard short integer solutions (SIS) assumption in the random oracle model.

Security and Communication NetworksJan 14, 20203 citations

Revocable ID-Based Signature with Short Size over Lattices

Ying-Hao Hung, Yuh‐Min Tseng, Sen‐Shan Huang

In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed. With the progress on the development of quantum technology, IBS schemes mentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional public-key settings, ID-based public-key settings have to offer a revocation mechanism to revoke misbehaving or malicious users. However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.

Security and Communication NetworksJan 1, 201718 citations

Poster: Post-Quantum Identity-Based Matching Encryption with Revocable Decryption Key

Jheng-Jia Huang, Guan Yu Chen, Nai‐Wei Lo

In recent years, scholars have developed Identity-Based Matching Encryption (IB-ME), which enables both the sender and the receiver to specify identities, ensuring ciphertext confidentiality only when these identities match. Building on this concept, our work introduces Revocable Identity-Based Matching Encryption (RIB-ME), which incorporates a revocable mechanism to withdraw decryption rights from unauthorized users. Current RIB-ME schemes rely on a variant of the Diffie-Hellman assumption, rendering it susceptible to quantum computing attacks. To address this vulnerability, we propose a generic construction of RIB-ME inspired by Wang et al. Our approach employs two-level Revocable Hierarchical Identity-Based Encryption (RHIBE) and Identity-Based Signature (IBS) and is compatible with post-quantum encryption schemes. This enables the development of a generic construction of RIB-ME and the creation of the first post-quantum RIB-ME through the use of post-quantum constructions.

ACM SIGSAC Conference on Computer and Communications Security (CCS)Dec 2, 20241 citation

Adaptive Secure Revocable Identity-based Signature Scheme over Lattices

Xiang Xin-yi

The security of traditional identity-based signatures wholly depends on the security of secret keys.Exposure of secret keys requires reissuing all previously assigned signatures.Based on this,to revoke private key leaks or malicious users in the signature scheme,an adaptive secure revocable identity-based signature over lattices is proposed,which provides an efficient revocation mechanism to revoke misbehaving or compromised users from the systems.The scheme is proved to be strongly Unforgeable against adaptive Chosen-message Attacks(sUFCMA)under Small Integer Solution(SIS)assumption.Security analysis results show that the proposed scheme not only can meet the security of revocable identity-based signature,but also can resist the quantum attack.

Jisuanji gongchengJan 1, 20158 citations

Novel efficient identity-based signature on lattices

Jiangshan Chen, Yupu Hu, Liang Hong-mei +1 more

With the rapid development of electronic information technology, digital signature has become an indispensable part of our lives. Traditional public key certificate cryptosystems cannot overcome the limitations of certificate management. Identity-based cryptosystems can avoid the certificate management issues. The development of quantum computers has brought serious challenges to traditional cryptography. Post-quantum cryptography research is imperative. At present, almost all post-quantum identity-based signature (IBS) schemes are constructed using Gaussian sampling or trapdoor technologies. However, these two technologies have a great impact on computational efficiency. To overcome this problem, we construct an IBS scheme on lattices by employing Lyubashevsky’s signature scheme. Based on the shortest vector problem on lattices, our scheme does not use Gaussian sampling or trapdoor technologies. In the random oracle model, it is proved that our scheme is strongly unforgeable against adaptive chosen messages and identity attacks. The security level of our scheme is strongly unforgeable, which is a higher level than the existential unforgeability of other schemes. Compared with other efficient schemes, our scheme has advantages in computation complexity and security.

Frontiers of Information Technology & Electronic EngineeringJul 2, 20207 citations

Adaptive-ID Secure Identity-Based Signature Scheme from Lattices in the Standard Model

Zecheng Wang, Xuemin Chen, Pingshui Wang

Identity-based signature (IBS) which is a paradigm built on public key cryptography has played a significant role in light-weight authentication. With the advent of the post quantum era, the lattice has become a main mathematical tool to construct quantum-immune cryptographic schemes. By utilizing an admissible hash function with compatible algorithms and lattice trapdoors as basic building blocks, we propose a new IBS scheme over lattices. The scheme is proved existentially unforgeable against adaptive identity attacks and chosen message attacks in the standard model under inhomogeneous short integer solution assumption via the generalized partitioning proof technique. Moreover, the scheme needs only logarithmic basic matrices as master public key while keeping the same private key size and signature size as those of other standard model lattice-based IBS schemes. This construction is the first adaptive-ID secure standard model IBS scheme over lattice with such space efficiency.

IEEE AccessJan 1, 20176 citations