Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Wu, Faguo; Zhou, Bo; Zhang, Xiao

doi:10.3390/e25030454

Cited by 11 publications

(3 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It bears mentioning that this scheme requires the correct choice of parameters in order to avoid the attack proposed in [20]. In [21], the authors employed the NTRU algorithm and developed a post-quantum blockchain architecture for the Internet of Things.…”

Section: Related Workmentioning

confidence: 99%

Development of modification of the post-quantum public-key cryptosystem NTRUENCRYPT

Lyashenko,

Cherckesova,

Revyakina

et al. 2023

E3S Web of Conf.

View full text Add to dashboard Cite

This work is devoted to the development of a modification of the post-quantum public-key cryptosystem NTRUEncrypt. Given that two main requirements for modern cryptographic algorithms are resistance to attacks (including quantum attacks) and performance, the developed modification offers an improvement in both aspects. Karatsuba algorithm for fast polynomial multiplication is employed to achieve better performance. The modification also includes additional protection against a chosen ciphertext attack that can be effectively against standard NTRUEncrypt. Performance test of the developed modification confirmed that less time is required for key generation, encryption and decryption in comparison with the classical algorithm. The modified algorithm is then applied to implement an asymmetric encryption system with a graphical user interface that allows establishing communication between two users with resistance to both classical and quantum attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Development of modification of the post-quantum public-key cryptosystem NTRUENCRYPT

Lyashenko,

Cherckesova,

Revyakina

et al. 2023

E3S Web of Conf.

View full text Add to dashboard Cite

show abstract

“…With the improvement of requirements, the signature method has evolved from certificate-based signatures, certificateless signatures and identity-based signatures to attribute-based signatures. At present, most proxy signatures are still identity-based proxy signatures (IBPS), such as [1,2]. This method uses the identity of the signer as the authentication mark to ensure the nonrepudiation and other characteristics of the signature.…”

Section: Introductionmentioning

confidence: 99%

Provable Secure Attribute-Based Proxy Signature Over Lattice Small Integer Solution Problem in Random Oracle Model

Wei

Liu

2023

Electronics

View full text Add to dashboard Cite

Current proxy signature schemes are mostly identity-based proxy signatures that distinguish users by identity. This signature method faces some problems, such as identity information leakage and single access control. Attribute-based proxy signature (ABPS) divides the signer’s identity information into a collection of attributes; thus, users’ identity information can be protected and access control can become fine-grained. With the development of quantum computers, the security of signature schemes based on traditional number theory problems is under threat. Therefore, we construct a new attribute-based proxy signature scheme on a lattice that can resist quantum attacks. This scheme has the properties of both attribute-based signatures and proxy signatures, i.e., fine-grained access control and strong undeniability properties. Moreover, based on the small integer solution problem (SIS), our scheme is provably secure in the random oracle model and protects the proxy signer in the adaptive security model.

show abstract

“…In 2013, Tian et first introduced the concept of message recovery to lattice-based cryptography. Wu et al [12] proposed an identity-based proxy signature scheme on the lattice also worked with message recovery. The difference between traditional digital sig and message recovery signatures is shown in Figure 1.…”

Section: Introductionmentioning

confidence: 99%

Lattice-Based Group Signature with Message Recovery for Federal Learning

et al. 2023

View full text Add to dashboard Cite

Federal learning and privacy protection are inseparable. The participants in federated learning need to be the targets of privacy protection. On the other hand, federated learning can also be used as a tool for privacy attacks. Group signature is regarded as an effective tool for preserving user privacy. Additionally, message recovery is a useful cryptographic primitive that ensures message recovery during the verification phase. In federated learning, message recovery can reduce the transmission of parameters and help protect parameter privacy. In this paper, we propose a lattice-based group signature with message recovery (GS-MR). We then prove that the GS-MR scheme has full anonymity and traceability under the random oracle model, and we reduce anonymity and traceability to the hardness assumptions of ring learning with errors (RLWE) and ring short integer solution (RSIS), respectively. Furthermore, we conduct some experiments to evaluate the sizes of key and signature, and make a performance comparison between three lattice-based group signature schemes and the GS-MR scheme. The results show that the message–signature size of GS-MR is reduced by an average of 39.17% for less than 2000 members.

show abstract

Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Cited by 11 publications

References 41 publications

Development of modification of the post-quantum public-key cryptosystem NTRUENCRYPT

Development of modification of the post-quantum public-key cryptosystem NTRUENCRYPT

Provable Secure Attribute-Based Proxy Signature Over Lattice Small Integer Solution Problem in Random Oracle Model

Lattice-Based Group Signature with Message Recovery for Federal Learning

Contact Info

Product

Resources

About