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

中国邮电高校学报:英文版

Improved lattice-based ring signature schemes from basis delegation

Wen Gao, Yupu Hu, Baocang Wang, Xie Jia

Published Jun 1, 2016• 4 citations
Publisher
DOI
10.1016/s1005-8885(16)60027-4

Related papers

A lattice-based ring signature scheme with gradual revelation of non-signers

Ramakant Kumar, Sahadeo Padhye

International Journal of Information Technology•Dec 3, 2024•2 citations

Forward Secure Lattice-Based Ring Signature Scheme in the Standard Model

Xiaoling Yu, Yuntao Wang

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

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

Rachid El Bansarkhani, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•60 citations

Efficient Ring Signature Scheme Without Random Oracle from Lattices

Wen Gao, Yupu Hu, Baocang Wang +2 more

Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.

Chinese Journal of Electronics•Mar 1, 2019•6 citations

Survey of Lattice-Based Group Signature

Lei Zhang, Zhiyong Zheng, Wei Wang

Financial Mathematics and Fintech•Jan 1, 2021•4 citations

Efficient Lattice-based Identity-based Ring Sigature and Analysis of Security

Zhang Li-l

Ring signature is a special digital signature,and it can be widely applied to many fields,such ase-election,mobile communication,mobile agent,e-commerce activities and so on.a lattice-based identity-based ring signature scheme is proposed in this paper.Based on the difficulties of SIS and ISIS on lattice,the proposed scheme is existentially unforgeable;Based on delegation technique,the scheme is more efficient.

Shuxue de shijian yu renshi•Jan 1, 2015•0 citations
Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.