An efficient fully dynamic group signature with message dependent opening from lattice
Open Access
- 3 May 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Cybersecurity
- Vol. 4 (1), 1-15
- https://doi.org/10.1186/s42400-021-00076-8
Abstract
No abstract availableKeywords
Funding Information
- The National Natural Science Foundation of China (No.61932019, No.61772521, No.61772522)
- The Key Research Program of Frontier Sciences, CAS (No.QYZDB-SSW-SYS035)
This publication has 31 references indexed in Scilit:
- Lattice-Based Group Signatures with Logarithmic Signature SizeLecture Notes in Computer Science, 2013
- A Toolkit for Ring-LWE CryptographyLecture Notes in Computer Science, 2013
- A Group Signature Scheme from Lattice AssumptionsLecture Notes in Computer Science, 2010
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Lattice-Based Identification Schemes Secure Under Active AttacksPublished by Springer Science and Business Media LLC ,2008
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice ProblemsLecture Notes in Computer Science, 2008
- Chosen-Ciphertext Security from Identity-Based EncryptionLecture Notes in Computer Science, 2004
- Design Validations for Discrete Logarithm Based Signature SchemesLecture Notes in Computer Science, 2000
- A new paradigm for public key identificationIEEE Transactions on Information Theory, 1996
- Group SignaturesLecture Notes in Computer Science, 1991