Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings

DOI10.1007/978-3-540-30539-2_26zbMath1094.94530OpenAlexW1519583411MaRDI QIDQ5465824

No author found.

Publication date: 12 August 2005

Published in: Advances in Cryptology - ASIACRYPT 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30539-2_26

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

Anonymous Authentication with Spread Revelation ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ Efficient traceable signatures in the standard model ⋮ Foundations of fully dynamic group signatures ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ Fair Traceable Multi-Group Signatures ⋮ On the Theoretical Gap between Group Signatures with and without Unlinkability ⋮ Foundations of Fully Dynamic Group Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ CCA secure encryption supporting authorized equality test on ciphertexts in standard model and its applications

This page was built for publication: Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings