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

KSII Transactions on Internet and Information Systems

A Fuzzy Identity-Based Signcryption Scheme from Lattices

Xiuhua Lu, Qiaoyan Wen, Wenmin Li, Licheng Wang, Hua Zhang

Published Nov 30, 2014• 1 citation
Publisher

Abstract

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.

DOI
10.3837/tiis.2014.11.031

Related papers

A Lattice-based Signcryption Scheme Without Trapdoors

LU Xiu-hua, Wen Qiao-yan, Licheng Wang +1 more

The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Sep 19, 2016•7 citations

Identity‐based signcryption from lattices

Jianhua Yan, Licheng Wang, Mianxiong Dong +2 more

Abstract Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity‐based cryptography is more convenient than public key infrastructure‐based cryptography in certificate management. As a result, identity‐based signcryption has been studied extensively, and many efficient and provably secure constructions have been proposed. However, most of these schemes are based on intractability assumptions from number theory, and these assumptions have been threatened by the booming quantum computation. Therefore, a recent trend in cryptography is to construct cryptosystems that are based on lattice‐based intractability assumptions because of their plausible features of quantum attack resistance. In this paper, several identity‐based signcryption schemes from lattice hardness assumptions are proposed. In the standard model, these schemes are indistinguishable againstinneradaptively chosen ciphertext attacks (IND‐CCA2) and strongly unforgeable againstinnerchosen message attacks. In our construction, it does not matter whether the original encryption scheme used to construct signcryption is deterministic or probabilistic; the resulted signcryption schemes can reach IND‐CCA2 security. To achieve this, we carefully combine three techniques—the identity‐based encryption from lattice due to Agrawal–Boneh–Boyen (EUROCRYPT 2010), the framework of lattice‐based short signature due to Boyen (Public Key Cryptography 2010), and the Canetti–Halevi–Katz (abbr. CHK) technique, with necessary and tailored optimization—for transforming an (ℓ+ 1)‐level indistinguishable under chosen plaintext attack secure hierarchical identity‐based encryption (HIBE) into anℓlevel IND‐CCA2 secure HIBE scheme. In addition, our security proof also contains a more efficient simulation tool that might have separate interest in cryptographic applications. Copyright © 2015 John Wiley & Sons, Ltd.

Security and Communication Networks•Jul 23, 2015•9 citations

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

Chunli Yang, Shihui Zheng, Licheng Wang +3 more

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.

Mathematical Problems in Engineering•Jan 1, 2014•6 citations

An Efficient Identity-based Signcryption from Lattice

Xiufeng Zhao, Xiang Wang

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.

International Journal of Security and Its Applications•Mar 31, 2014•3 citations

Improved Lattice-Based Signcryption in the Standard Model

Xiaopeng Yang, Hao Cao, Weichun Li +1 more

Signcryption is a basic cryptographic primitive that simultaneously captures the functions of encryption and signature. To realize comprehensive information security against quantum computing attacks, lattice-based signcryption schemes have been successively proposed. However, the performance of signcryption schemes should be improved in the lattice setting. An efficient lattice-based signcryption scheme in the standard model is proposed in this paper. Under the ring learning with errors (RLWE) assumption and the ideal short integer solution (ISIS) assumption, the proposed signcryption scheme achieves indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability under an adaptive chosen-message attack (EUF-ACMA). Our scheme not only reduces the communication and computational overhead but also realizes a new design that combines the partitioning technique with the idea of tag-based key encapsulation. The performance analysis results show that our scheme is more efficient than previous lattice-based signcryption schemes in the standard model.

IEEE Access•Jan 1, 2019•15 citations

A Lattice-Based Multi-Receiver Signcryption Scheme for Point to Multi-Point Communication

Xiuhua Lu, Qiaoyan Wen, Licheng Wang +1 more

In order to guarantee information confidentiality and authentication in point to multi-point communication mode, we propose the first secure multi-receiver signcryption scheme based on lattice. We prove that our scheme achieves the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and existential unforgeability against adaptive chosen message attacks under the inhomogeneous small integer solution assumption. Our scheme resists the existing quantum algorithm analysis, since we construct it in lattice-based cryptography.

International Conference on Information and Network Security (ICINS)•Jan 1, 2013•1 citation
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.
The existing lattice-based signcryption schemes are based on trapdoor generation algorithm and preimage sample algorithm. However, both algorithms are complex, require a lot of time to run, and affect the efficiency of latticed-based signcryption schemes deeply. To solve this problem, the first lattice-based signcryption scheme without trapdoor generation algorithm and preimage sample algorithm is proposed, with the help of the technique of lattice signatures without trapdoors and the associated signature compression technique, as well as the encryption method based on the learning with errors assumption. The scheme achieves indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption. It also achieves existential unforgeability against adaptive chosen message attacks under the small integer solution assumption. The proposed scheme is not only quantum resistant, but also efficient.
Abstract Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity‐based cryptography is more convenient than public key infrastructure‐based cryptography in certificate management. As a result, identity‐based signcryption has been studied extensively, and many efficient and provably secure constructions have been proposed. However, most of these schemes are based on intractability assumptions from number theory, and these assumptions have been threatened by the booming quantum computation. Therefore, a recent trend in cryptography is to construct cryptosystems that are based on lattice‐based intractability assumptions because of their plausible features of quantum attack resistance. In this paper, several identity‐based signcryption schemes from lattice hardness assumptions are proposed. In the standard model, these schemes are indistinguishable againstinneradaptively chosen ciphertext attacks (IND‐CCA2) and strongly unforgeable againstinnerchosen message attacks. In our construction, it does not matter whether the original encryption scheme used to construct signcryption is deterministic or probabilistic; the resulted signcryption schemes can reach IND‐CCA2 security. To achieve this, we carefully combine three techniques—the identity‐based encryption from lattice due to Agrawal–Boneh–Boyen (EUROCRYPT 2010), the framework of lattice‐based short signature due to Boyen (Public Key Cryptography 2010), and the Canetti–Halevi–Katz (abbr. CHK) technique, with necessary and tailored optimization—for transforming an (ℓ+ 1)‐level indistinguishable under chosen plaintext attack secure hierarchical identity‐based encryption (HIBE) into anℓlevel IND‐CCA2 secure HIBE scheme. In addition, our security proof also contains a more efficient simulation tool that might have separate interest in cryptographic applications. Copyright © 2015 John Wiley & Sons, Ltd.
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.
Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.
Signcryption is a basic cryptographic primitive that simultaneously captures the functions of encryption and signature. To realize comprehensive information security against quantum computing attacks, lattice-based signcryption schemes have been successively proposed. However, the performance of signcryption schemes should be improved in the lattice setting. An efficient lattice-based signcryption scheme in the standard model is proposed in this paper. Under the ring learning with errors (RLWE) assumption and the ideal short integer solution (ISIS) assumption, the proposed signcryption scheme achieves indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and existential unforgeability under an adaptive chosen-message attack (EUF-ACMA). Our scheme not only reduces the communication and computational overhead but also realizes a new design that combines the partitioning technique with the idea of tag-based key encapsulation. The performance analysis results show that our scheme is more efficient than previous lattice-based signcryption schemes in the standard model.
In order to guarantee information confidentiality and authentication in point to multi-point communication mode, we propose the first secure multi-receiver signcryption scheme based on lattice. We prove that our scheme achieves the indistinguishability against adaptive chosen ciphertext attacks under the learning with errors assumption and existential unforgeability against adaptive chosen message attacks under the inhomogeneous small integer solution assumption. Our scheme resists the existing quantum algorithm analysis, since we construct it in lattice-based cryptography.