Zero-Knowledge Proof System for Fully Anonymous Attribute Based Group Signatures from Lattices with VLR

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Signature schemes with Verifier-Local Revocation (VLR) fail to achieve stronger anonymity notion, full-anonymity. In full-anonymity, it is free to corrupt the secret signing keys. Secret signing keys of VLR schemes consist of tokens which can be used to identify the users. Thus VLR schemes restrict corrupting secret signing keys. VLR schemes can achieve full-anonymity by separating tokens from secret signing keys. However, separation of tokens gives space to signers to replace tokens with fake values. Generating signatures with fake tokens can be prevented with a suitable proof system. This paper proposes a new zero-knowledge protocol to support provers to convince verifiers, that attributes used for creating the signature are valid and have naive tokens. Moreover, this paper offers a new Attribute-Based Group Signature (ABGS) scheme, that uses the proposed protocol and achieves full anonymity.

Cite

CITATION STYLE

APA

Perera, M. N. S., Nakamura, T., Hashimoto, M., & Yokoyama, H. (2020). Zero-Knowledge Proof System for Fully Anonymous Attribute Based Group Signatures from Lattices with VLR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11897 LNCS, pp. 126–140). Springer. https://doi.org/10.1007/978-3-030-39303-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free