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

Signcryption in a Quantum World

Shravan Kumar Parshuram Puria

Published Apr 16, 2021• 1 citation
OpenAlex

Related papers

Post-Quantum Signcryption From Lattice-Based Signatures.

François Gérard, Keno Merckx

•Jan 1, 2018•3 citations

Signcryption with Quantum Random Oracles

Shingo Sato, Junji Shikata

Lecture notes in computer science•Jan 1, 2018•2 citations

A post-quantum communication secure identity-based proxy-signcryption scheme

Xiaojun Zhang, Chunxiang Xu, Chunhua Jin +1 more

Proxy-signcryption is a variation of an ordinary signcryption scheme and has been used in many applications where the delegation of rights is quite common. In a proxy-signcryption scheme, an original signcrypter needs to delegate his signcryption capability to a proxy signcrypter to signcrypt messages on behalf of the original signcrypter. By combining the functionalities of proxy signature with identity-based signcryption, in this paper, we propose a novel identity-based proxy-signcryption scheme (IBPSC) from lattice assumptions in the random oracle model. Meanwhile, the security requirements of our IBPSC scheme have been analysed, and our scheme can even resist quantum computer attacks. Compared with existing IBPSC schemes, our scheme is more secure and more efficient. To the best of our knowledge, there is still no relevant IBPSC scheme based on lattice, which is an interesting stepping stone in the post-quantum cryptographic communication.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2015•5 citations

Cryptography in a Quantum World

Gilles Brassard

arXiv:1510.04256•Lecture notes in computer science•Jan 1, 2016•7 citations

Post-Quantum Secure Hybrid Signcryption from Lattice Assumption

Fenghe Wang, Yupu Hu, Chunxiao Wang

Motivated by the demand to have secure signcryption scheme, even in quantum era, the concept of signcryption tag-KEM (key encapsulation machine) is extended to lattice cryptography in this paper. A lattice-based hybrid signcryption scheme is proposed by building a lattice-based signcryption tag-KEM. Based on the hardness of the learning with errors problem and the short integer solution problem, the proposed hybrid signcryption is provable secure in the random oracle model. Furthermore, according to the quantum intractability assumption about lattice problem, the proposed hybrid signcryption scheme is secure even on quantum computers.

Applied Mathematics & Information Sciences•Jan 1, 2012•18 citations

Quantum Cryptography

WORLD SCIENTIFIC eBooks•Nov 1, 2010•0 citations
Proxy-signcryption is a variation of an ordinary signcryption scheme and has been used in many applications where the delegation of rights is quite common. In a proxy-signcryption scheme, an original signcrypter needs to delegate his signcryption capability to a proxy signcrypter to signcrypt messages on behalf of the original signcrypter. By combining the functionalities of proxy signature with identity-based signcryption, in this paper, we propose a novel identity-based proxy-signcryption scheme (IBPSC) from lattice assumptions in the random oracle model. Meanwhile, the security requirements of our IBPSC scheme have been analysed, and our scheme can even resist quantum computer attacks. Compared with existing IBPSC schemes, our scheme is more secure and more efficient. To the best of our knowledge, there is still no relevant IBPSC scheme based on lattice, which is an interesting stepping stone in the post-quantum cryptographic communication.
Motivated by the demand to have secure signcryption scheme, even in quantum era, the concept of signcryption tag-KEM (key encapsulation machine) is extended to lattice cryptography in this paper. A lattice-based hybrid signcryption scheme is proposed by building a lattice-based signcryption tag-KEM. Based on the hardness of the learning with errors problem and the short integer solution problem, the proposed hybrid signcryption is provable secure in the random oracle model. Furthermore, according to the quantum intractability assumption about lattice problem, the proposed hybrid signcryption scheme is secure even on quantum computers.