Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme
In order to solve the problem of large key size and low efficiency in the linkable ring signature scheme on lattice, this paper reconstructs the linkable ring signature scheme from lattice based on the ring learning with errors (RLWE) problem, according to the technical route of “homomorphic commitm...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2020-07-01
|
| Series: | Jisuanji kexue yu tansuo |
| Subjects: | |
| Online Access: | http://fcst.ceaj.org/CN/abstract/abstract2265.shtml |
| _version_ | 1819112554307256320 |
|---|---|
| author | YE Qing, WANG Wenbo, LI Yingying, QIN Panke, ZHAO Zongqu, WANG Yongjun |
| author_facet | YE Qing, WANG Wenbo, LI Yingying, QIN Panke, ZHAO Zongqu, WANG Yongjun |
| author_sort | YE Qing, WANG Wenbo, LI Yingying, QIN Panke, ZHAO Zongqu, WANG Yongjun |
| collection | DOAJ |
| description | In order to solve the problem of large key size and low efficiency in the linkable ring signature scheme on lattice, this paper reconstructs the linkable ring signature scheme from lattice based on the ring learning with errors (RLWE) problem, according to the technical route of “homomorphic commitment→∑-protocol→Fiat-Shamir transformation”. This paper first constructs a homomorphic commitment scheme over a polynomial ring based on the RLWE problem, and then designs a ∑-protocol based on the commitment scheme, and transforms the ∑-protocol into a linkable ring signature scheme using the Fiat-Shamir transformation methods. Finally, this paper proposes a simple digital currency model based on the linkable ring signature scheme. Security analysis shows since the proposed scheme is constructed based on the problem of RLWE, its security can reduce to the lattice-based difficult problem and resist the quantum computer attack. Efficiency analysis shows compared with the previous linkable ring signature schemes on lattice, since the ring elements in the scheme are taken from small polynomials, the proposed scheme has shorter key size and higher computational efficiency, and the description of the scheme is simpler. |
| first_indexed | 2024-12-22T04:15:21Z |
| format | Article |
| id | doaj.art-bc35180a63094f1c9f55a85dff2304ce |
| institution | Directory Open Access Journal |
| issn | 1673-9418 |
| language | zho |
| last_indexed | 2024-12-22T04:15:21Z |
| publishDate | 2020-07-01 |
| publisher | Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press |
| record_format | Article |
| series | Jisuanji kexue yu tansuo |
| spelling | doaj.art-bc35180a63094f1c9f55a85dff2304ce2022-12-21T18:39:26ZzhoJournal of Computer Engineering and Applications Beijing Co., Ltd., Science PressJisuanji kexue yu tansuo1673-94182020-07-011471164117210.3778/j.issn.1673-9418.1904022Using Ring Learning with Errors Problem to Construct Linkable Ring Signature SchemeYE Qing, WANG Wenbo, LI Yingying, QIN Panke, ZHAO Zongqu, WANG Yongjun0College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan 454000, ChinaIn order to solve the problem of large key size and low efficiency in the linkable ring signature scheme on lattice, this paper reconstructs the linkable ring signature scheme from lattice based on the ring learning with errors (RLWE) problem, according to the technical route of “homomorphic commitment→∑-protocol→Fiat-Shamir transformation”. This paper first constructs a homomorphic commitment scheme over a polynomial ring based on the RLWE problem, and then designs a ∑-protocol based on the commitment scheme, and transforms the ∑-protocol into a linkable ring signature scheme using the Fiat-Shamir transformation methods. Finally, this paper proposes a simple digital currency model based on the linkable ring signature scheme. Security analysis shows since the proposed scheme is constructed based on the problem of RLWE, its security can reduce to the lattice-based difficult problem and resist the quantum computer attack. Efficiency analysis shows compared with the previous linkable ring signature schemes on lattice, since the ring elements in the scheme are taken from small polynomials, the proposed scheme has shorter key size and higher computational efficiency, and the description of the scheme is simpler.http://fcst.ceaj.org/CN/abstract/abstract2265.shtmlcommitment schemezero-knowledge proofring learning with errors (rlwe)linkable ring signature |
| spellingShingle | YE Qing, WANG Wenbo, LI Yingying, QIN Panke, ZHAO Zongqu, WANG Yongjun Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme Jisuanji kexue yu tansuo commitment scheme zero-knowledge proof ring learning with errors (rlwe) linkable ring signature |
| title | Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme |
| title_full | Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme |
| title_fullStr | Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme |
| title_full_unstemmed | Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme |
| title_short | Using Ring Learning with Errors Problem to Construct Linkable Ring Signature Scheme |
| title_sort | using ring learning with errors problem to construct linkable ring signature scheme |
| topic | commitment scheme zero-knowledge proof ring learning with errors (rlwe) linkable ring signature |
| url | http://fcst.ceaj.org/CN/abstract/abstract2265.shtml |
| work_keys_str_mv | AT yeqingwangwenboliyingyingqinpankezhaozongquwangyongjun usingringlearningwitherrorsproblemtoconstructlinkableringsignaturescheme |