Mathematical Problems in Engineering

A Fuzzy Identity‐Based Signature Scheme from Lattices in the Standard Model

Chunli Yang, Shihui Zheng, Licheng Wang, Miaomiao Tian, Lize Gu, Yixian Yang

Published Jan 1, 2014• 6 citations

Abstract

A fuzzy identity‐based signature (FIBS) scheme allows a user with identity ID to issue a signature that could be verified with identity ID′ if and only if ID and ID′ lie within a certain distance. To obtain an FIBS scheme that can resist known quantum attacks, we use the double‐trapdoor technique from ABB10a for secret key extracting and the vanishing trapdoor technique from Boyen10 for message signing. In addition, in order to reflect the functionality of fuzziness, Shamir secret sharing scheme is also used in our construction. In this paper, we propose an FIBS scheme from lattices and prove that this new scheme achieves strong unforgeability under selective chosen‐identity and adaptive chosen‐message attacks (SU‐sID‐CMA) in the standard model. To the best of our knowledge, our scheme is not only the first FIBS scheme from lattices without random oracles but also the first FIBS scheme that achieves strong unforgeability.

DOI: 10.1155/2014/391276

Related papers

Post-quantum Strongly Unforgeable Identity-Based Signature Scheme from Lattices without Random Oracles

Zhenhua Liu, Xiangsong Zhang, Tsuyoshi Takagi

Inspired by Agrawal, Boneh and Boyen's identity-based encryption scheme, we proposed a post-quantum identity-based signature scheme from lattices. In this construction, two distinct trapdoors are used to find short bases. One trapdoor enables the real implementation to generate short bases for all lattices. The other trapdoor enables the simulator to generate short bases for all lattices. Moreover, the generating short bases are used to sample short vectors as signatures. Based on the hardness of the small integer solution (SIS) problem, the proposed scheme is proven to be strongly unforgeable against adaptive chosen-identity and adaptive chosen-message attacks without using random oracles. Compared with the existing strongly unforgeable identity-based signature schemes, our scheme has the advantages of full security and resistance to quantum computing attacks.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)Sep 1, 20131 citation

Identity-based blind signature from lattices

Wen Gao, Yupu Hu, Baocang Wang +2 more

Blind signature allows a user to get a signature of a signer on an arbitrary message, and the verifier can convince that the signature is indeed signed by the signer without leaking any information about the message. This property is necessary when the user’s privacy needs protection, such as a bank bill, a trade secret, etc. As an alternative of public key infrastructure, the identity-based system can simplify the key management procedures in certificate-based public key systems. Inspired by the requirement of identity-based blind signature in the post quantum world, we research on identity-based blind signature based on hard lattice problems under the random Oracle model. We propose a construction built upon the blind signature by Rückert, and it is proved to be one-more unforgeable against selective identity and chosen message attacks (sID-CMA) and unconditionally blind. The proposed scheme has 2 moves, and its security can be reduced to the small integer solution (SIS) problem.

Wuhan University Journal of Natural SciencesJul 14, 20177 citations

A Fuzzy Identity-Based Signcryption Scheme from Lattices

Xiuhua Lu, Qiaoyan Wen, Wenmin Li +2 more

Fuzzy identity-based cryptography introduces the threshold structure into identity-based cryptography, changes the receiver of a ciphertext from exact one to dynamic many, makes a cryptographic scheme more efficient and flexible.In this paper, we propose the first fuzzy identity-based signcryption scheme in lattice-based cryptography.Firstly, we give a fuzzy identity-based signcryption scheme that is indistinguishable against chosen plaintext attack under selective identity model.Then we apply Fujisaki-Okamoto method to obtain a fuzzy identity-based signcryption scheme that is indistinguishable against adaptive chosen ciphertext attack under selective identity model.Thirdly, we prove our scheme is existentially unforgeable against chosen message attack under selective identity model.As far as we know, our scheme is the first fuzzy identity-based signcryption scheme that is secure even in the quantum environment.

KSII Transactions on Internet and Information SystemsNov 30, 20141 citation

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

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

A New Hierarchical Identity-based Signature Scheme From Lattices In The Standard Model

Miaomiao Tian, Liusheng Huang, Wei Yang

Hierarchical identity-based signature (HIBS), which plays an important role in large communities, is a generaliza-tion of identity-based signature (IBS). In this paper, we present a new HIBS scheme from lattices without ran-dom oracles. The new scheme is proven to be strongly unforgeable against selective identity attacks under the standard hardness assumption of the short integer so-lution (SIS) problem. Furthermore, the secret key size and the signature length of our scheme are both invariant and much shorter than those of the previous lattice-based HIBS schemes. To the best of our knowledge, our con-struction is the first short lattice-based HIBS scheme in the standard model.

Jan 1, 201115 citations