格上本地验证者撤销属性基群签名的零知识证明

张彦华; 胡予濮; 刘西蒙; 张启坤; 贾惠文

doi:10.11999/JEIT190587

格上本地验证者撤销属性基群签名的零知识证明

doi: 10.11999/JEIT190587

1.
郑州轻工业大学计算机与通信工程学院郑州 450002
2.
西安电子科技大学通信工程学院西安 710071
3.
福州大学数学与计算机科学学院福州 350108
4.
广州大学数学与信息科学学院广州 510006

基金项目: 国家自然科学基金(61672412, 61772477)

详细信息

作者简介:
张彦华：男，1989年生，讲师，研究方向为格公钥密码学、属性基密码学和后量子密码学等

胡予濮：男，1955年生，教授，研究方向为多线性映射、后量子密码学等

刘西蒙：男，1988年生，研究员，研究方向为私计算、密文数据挖掘等

张启坤：男，1980年生，副教授，研究方向为群组密钥协商等

贾惠文：男，1990年生，讲师，研究方向为多线性映射、格公钥密码学等

通讯作者:
张彦华　yhzhang@zzuli.edu.cn

中图分类号: TN918, TP309
计量
- 文章访问数: 2405
- HTML全文浏览量: 769
- PDF下载量: 99
- 被引次数: 0
出版历程
- 收稿日期: 2019-08-05
- 修回日期: 2019-10-31
- 网络出版日期: 2019-11-25
- 刊出日期: 2020-02-19

Zero-knowledge Proofs for Attribute-Based Group Signatures with Verifier-local Revocation Over Lattices

1.
School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China
2.
School of Telecommunications Engineering, Xidian University, Xi’an 710071, China
3.
College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China
4.
School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China

Funds: The National Natural Science Foundation of China (61672412, 61772477)

摘要

摘要: 属性基群签名(ABGS)是一类特殊形式的群签名，其允许拥有某些特定属性的群成员匿名地代表整个群对消息进行签名；当有争议发生时，签名打开实体可以有效地追踪出真实签名者。针对格上第1个支持本地验证者撤销的属性基群签名群公钥尺寸过长，空间效率不高的问题，该文采用仅需固定矩阵个数的紧凑的身份编码技术对群成员身份信息进行编码，使得群公钥尺寸与群成员个数无关；进一步地，给出新的Stern类统计零知识证明协议，该协议可以有效地证明群成员的签名特权，而其撤销标签则通过单向和单射的带误差学习函数来进行承诺。
- 属性基群签名 /
- 格 /
- 本地验证者撤销 /
- 零知识证明 /
- 带误差学习
Abstract: Attribute-Based Group Signature(ABGS) is a new variant of group signature, and it allows group members with certain specific attributes to sign messages on behalf of the whole group anonymously; Once any dispute arises, an opening authority can effectively reveal and track the real identity information of the singer. For the problem that the first lattice-based attribute-based group signature scheme with verifier-local revocation has a long bit-size of group public-key, and thus a low space efficiency, a compact identity-encoding technique which only needs a fixed number of matrices is adopted to encode the identity information of group members, so that the bit-size of group public-key is independent of the number of group members. Moreover, a new Stern-like statistical zero-knowledge proofs protocol is proposed, which can effectively prove the member’s signature privilege, and its revocation-token is bound to a one-way and injective learning with errors function.
- Attribute-Based Group Signature (ABGS) /
- Lattice /
- Verifier-local revocation /
- Zero-knowledge proofs /
- Learning With Errors (LWE)

HTML全文

参考文献(14)

KHADER D. Attribute based group signatures[EB/OL]. http://eprint.iacr.org/2007/159, 2007.

CHAUM D and VAN HEYST E. Group signatures[C]. The Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991: 257–265. doi: 10.1007/3-540-46416-6_22.

RIVEST R L, SHAMIR A, and TAUMAN Y. How to leak a secret[C]. The 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, 2001: 552–565. doi: 10.1007/3-540-45682-1_32.

MAJI H, PRABHAKARAN M, and ROSULEK M. Attribute-based signatures[C]. The Cryptographers’ Track at the RSA Conference on Topics in Cryptology, San Francisco, USA, 2011: 376–392. doi: 10.1007/978-3-642-19074-2_24.

KUCHTA V, SAHU R A, SHARMA G, et al. On new zero-knowledge arguments for attribute-based group signatures from lattices[C]. The 20th International Conference on Information Security and Cryptology, Seoul, South Korea, 2017: 284–309. doi: 10.1007/978-3-319-78556-1_16.

ZHANG Yanhua, GAN Yong, YIN Yifeng, et al. Attribute-based VLR group signature scheme from lattices[C]. The 18th International Conference on Algorithms and Architectures for Parallel Processing, Guangzhou, China, 2018: 600–610. doi: 10.1007/978-3-030-05063-4_46.

MICCIANCIO D and PEIKERT C. Trapdoors for lattices: Simpler, tighter, faster, smaller[C]. The 31st International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, 2012: 700–718. doi: 10.1007/978-3-642-29011-4_41.

NGUYEN P Q, ZHANG Jiang, and ZHANG Zhenfeng. Simpler efficient group signatures from lattices[C]. The 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, USA, 2015: 401–426. doi: 10.1007/978-3-662-46447-2_18.

GENTRY C, PEIKERT C, and VAIKUNTANATHAN V. Trapdoors for hard lattices and new cryptographic constructions[C]. The 40th Annual ACM Symposium on Theory of Computing, Victoria, Canada, 2008, 197–206. doi: 10.1145/1374376.1374407.

MICCIANCIO D and PEIKERT C. Hardness of SIS and LWE with small parameters[C]. The 33rd Annual Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2013: 21–39. doi: 10.1007/978-3-642-40041-4_2.

REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]. The 37th Annual ACM Symposium on Theory of Computing, Baltimore, USA, 2005, 84–93. doi: 10.1145/1060590.1060603.

LING San, NGUYEN K, ROUX-LANGLOIS A, et al. A lattice-based group signature scheme with verifier-local revocation[J]. Theoretical Computer Science, 2018, 730: 1–20. doi: 10.1016/j.tcs.2018.03.027

LING San, NGUYEN K, STEHLÉ D, et al. Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications[C]. The 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, 2013: 107–124. doi: 10.1007/978-3-642-36362-7_8.

KAWACHI A, TANAKA K, and XAGAWA K. Concurrently secure identification schemes based on the worst-case hardness of lattice problems[C]. The 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, 2008: 372–389. doi: 10.1007/978-3-540-89255-7_23.

施引文献

资源附件(0)

访问统计