Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation

DOI10.1007/978-3-319-99807-7_14zbMath1518.94120OpenAlexW2890569207MaRDI QIDQ6108614

Maharage Nisansala Sevwandi Perera, Takeshi Koshiba

Publication date: 30 June 2023

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-99807-7_14

zbMATH Keywords

verifier-local revocationalmost-full anonymitydynamical-almost-full anonymitylattice-based group signaturesmember registration

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Decade of Lattice Cryptography
• Foundations of Fully Dynamic Group Signatures
• Lattice-Based Group Signatures with Logarithmic Signature Size
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
• Fully Anonymous Attribute Tokens from Lattices
• Simpler Efficient Group Signatures from Lattices
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• A Group Signature Scheme from Lattice Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
• Group Signatures
• Lattice-Based Group Signature Scheme with Verifier-Local Revocation
• Topics in Cryptology – CT-RSA 2005
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation