A New Constant-Size Group Signature Scheme From Lattices
A lattice-based group signature scheme (LGSS) is an active cryptographic primitive, where each group member can sign messages anonymously in the name of the entire group and each valid signature should be traced to some group member on the lattice. In each LGSS, the size of the group signature usual...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8951148/ |
| _version_ | 1819175833016729600 |
|---|---|
| author | Qin Luo Chun-Yang Jiang |
| author_facet | Qin Luo Chun-Yang Jiang |
| author_sort | Qin Luo |
| collection | DOAJ |
| description | A lattice-based group signature scheme (LGSS) is an active cryptographic primitive, where each group member can sign messages anonymously in the name of the entire group and each valid signature should be traced to some group member on the lattice. In each LGSS, the size of the group signature usually depends on the number of group members and the security parameter. Thus, designing a constant-size LGSS is an interesting problem. At PKC 2018, Ling, Nguyen, Wang and Xu presented the first constant-size group signature scheme under lattice assumptions. Its design is based on a zero-knowledge argument of the knowledge of a valid message-signature pair for the Ducas-Micciancio signature scheme, which follows the sign-then-encrypt-then-prove protocol. In contrast to this work, we construct a new constant-size LGSS. The scheme adopts the sign-hybrid-encrypt approach and makes use of the Lyubashevsky signature scheme. Our work is efficient in the signing algorithm, more precise on the open algorithm and shorter in public key, secret key and signature size than previous studies. Furthermore, we prove that the scheme has full anonymity and full traceability under the Ring Learning With Errors and Ring Short Integer Solution assumptions in the random oracle model. |
| first_indexed | 2024-12-22T21:01:08Z |
| format | Article |
| id | doaj.art-acffbbf073004b1586b3745b94e9a0ec |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-22T21:01:08Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-acffbbf073004b1586b3745b94e9a0ec2022-12-21T18:12:50ZengIEEEIEEE Access2169-35362020-01-018101981020710.1109/ACCESS.2020.29646868951148A New Constant-Size Group Signature Scheme From LatticesQin Luo0https://orcid.org/0000-0002-2065-0292Chun-Yang Jiang1https://orcid.org/0000-0001-7054-0764School of Mathematical Sciences, Fudan University, Shanghai, ChinaMathematics and Institute of Mathematics, Jilin University, Changchun, ChinaA lattice-based group signature scheme (LGSS) is an active cryptographic primitive, where each group member can sign messages anonymously in the name of the entire group and each valid signature should be traced to some group member on the lattice. In each LGSS, the size of the group signature usually depends on the number of group members and the security parameter. Thus, designing a constant-size LGSS is an interesting problem. At PKC 2018, Ling, Nguyen, Wang and Xu presented the first constant-size group signature scheme under lattice assumptions. Its design is based on a zero-knowledge argument of the knowledge of a valid message-signature pair for the Ducas-Micciancio signature scheme, which follows the sign-then-encrypt-then-prove protocol. In contrast to this work, we construct a new constant-size LGSS. The scheme adopts the sign-hybrid-encrypt approach and makes use of the Lyubashevsky signature scheme. Our work is efficient in the signing algorithm, more precise on the open algorithm and shorter in public key, secret key and signature size than previous studies. Furthermore, we prove that the scheme has full anonymity and full traceability under the Ring Learning With Errors and Ring Short Integer Solution assumptions in the random oracle model.https://ieeexplore.ieee.org/document/8951148/Group signatureslatticesLyubashevsky signature schemering learning with errorsring short integer solution |
| spellingShingle | Qin Luo Chun-Yang Jiang A New Constant-Size Group Signature Scheme From Lattices IEEE Access Group signatures lattices Lyubashevsky signature scheme ring learning with errors ring short integer solution |
| title | A New Constant-Size Group Signature Scheme From Lattices |
| title_full | A New Constant-Size Group Signature Scheme From Lattices |
| title_fullStr | A New Constant-Size Group Signature Scheme From Lattices |
| title_full_unstemmed | A New Constant-Size Group Signature Scheme From Lattices |
| title_short | A New Constant-Size Group Signature Scheme From Lattices |
| title_sort | new constant size group signature scheme from lattices |
| topic | Group signatures lattices Lyubashevsky signature scheme ring learning with errors ring short integer solution |
| url | https://ieeexplore.ieee.org/document/8951148/ |
| work_keys_str_mv | AT qinluo anewconstantsizegroupsignatureschemefromlattices AT chunyangjiang anewconstantsizegroupsignatureschemefromlattices AT qinluo newconstantsizegroupsignatureschemefromlattices AT chunyangjiang newconstantsizegroupsignatureschemefromlattices |