Sciweavers

10 search results - page 1 / 2
» Efficient Anonymous Fingerprinting with Group Signatures
Sort
View
IIWAS
2004
13 years 6 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
13 years 2 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud
ASIACRYPT
2004
Springer
13 years 8 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
ASIACRYPT
2003
Springer
13 years 8 months ago
Efficient Group Signatures without Trapdoors
Abstract. Group signature schemes are fundamental cryptographic tools that enable unlinkably anonymous authentication, in the same fashion that digital signatures provide the basis...
Giuseppe Ateniese, Breno de Medeiros