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

Theoretical Computer Science

Provably secure certificateless proxy signature scheme in the standard model

Yang Lu, Jiguo Li

Published May 24, 2016• 21 citations
Publisher
DOI
10.1016/j.tcs.2016.05.019

Related papers

Security analysis and improvement of certificateless proxy blind signature

Rong-liang GE, De-zhi GAO, Jing-ling LIANG +1 more

Journal of Computer Applications•Apr 1, 2013•1 citation

Provably secure certificateless deniable authenticated encryption scheme

Jayaprakash Kar

Journal of Information Security and Applications•Aug 5, 2020•9 citations

Lattice-based Proxy Signature Scheme in the Standard Model

Ming-Xian Li

The provably secure public-key cryptosystems in the standard model are more practical,but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen's preimage sampling algorithm. The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution( SIS) problem in the standard model. Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes. The comparative results showed that the proposed proxy signature scheme has higher efficiency.

Journal of Sichuan University•Jan 1, 2014•1 citation

Certificateless network coding proxy signatures from lattice

Huifang Yu, Ning Wang

Frontiers of Computer Science•Dec 13, 2022•8 citations

Lattice-based Proxy Signature Scheme in the Standard Model

Mingxiang Li, 郑艳娟, Ming XU

Abstract:The provably secure public-key cryptosystems in the standard model are more practical, but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen’s preimage sampling algorithm.The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution (SIS) problem in the standard model.Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes.The comparative results showed that the proposed proxy signature scheme has higher efficiency.

•Jan 1, 2014•0 citations

Efficient and Provably-Secure Certificate-Based Key Encapsulation Mechanism in the Standard Model

Lu Yang and Li Jiguo

Journal of Computer Research and Development•Jul 1, 2014•1 citation
The provably secure public-key cryptosystems in the standard model are more practical,but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen's preimage sampling algorithm. The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution( SIS) problem in the standard model. Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes. The comparative results showed that the proposed proxy signature scheme has higher efficiency.
Abstract:The provably secure public-key cryptosystems in the standard model are more practical, but the provably secure lattice-based proxy signature schemes in the standard model have not been constructed up to now. A new lattice-based proxy signature scheme was constructed by using the Boyen’s preimage sampling algorithm.The proposed proxy signature scheme was proved to satisfy the existential unforgeability against adaptive chosen-message attacks based on the hardness of the small integer solution (SIS) problem in the standard model.Finally,the computational performance of the proposed proxy signature scheme was compared with that of the existing lattice-based proxy signature schemes.The comparative results showed that the proposed proxy signature scheme has higher efficiency.