Get Shorty via Group Signatures without Encryption

DOI10.1007/978-3-642-15317-4_24zbMath1291.94179OpenAlexW1567039325MaRDI QIDQ3588355

Jan Camenisch, Bogdan Warinschi, Gregory Neven, Patrik Bichsel, Nigel P. Smart

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15317-4_24

zbMATH Keywords

pairingsgroup signaturesgroup signature security definition

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (16)

On QA-NIZK in the BPK Model ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Rerandomizable signatures under standard assumption ⋮ Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Threshold signatures with private accountability ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Foundations of fully dynamic group signatures ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Foundations of Fully Dynamic Group Signatures ⋮ Group signatures with user-controlled and sequential linkability ⋮ Updatable signatures and message authentication codes ⋮ An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users ⋮ Partially structure-preserving signatures: lower bounds, constructions and more

This page was built for publication: Get Shorty via Group Signatures without Encryption