Welcome to the resource topic for 2015/020
Title:
Simpler Efficient Group Signatures from Lattices
Authors: Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang
Abstract:A group signature allows a group member to anonymously sign messages on behalf of the group. In the past few years, new group signatures based on lattice problems have appeared: the most efficient lattice-based constructions are due to Laguillaumie {\it et al.} (Asiacrypt '13) and Langlois {\it et al.} (PKC '14). Both have at least O(n^2\log^2 n \log N)-bit group public key and O(n\log^3 n\log N)-bit signature, where n is the security parameter and N is the maximum number of group members. In this paper, we present a simpler lattice-based group signature, which is more efficient by a O(\log N) factor in both the group public key and the signature size. We achieve this by using a new non-interactive zero-knowledge (NIZK) proof corresponding to a simple identity-encoding function. The security of our group signature can be reduced to the hardness of SIS and LWE in the random oracle model.
ePrint: https://eprint.iacr.org/2015/020
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .