Sciweavers

75 search results - page 2 / 15
» Efficient Revocation in Group Signatures
Sort
View
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 4 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
WISTP
2010
Springer
13 years 8 months ago
Efficient Mutual Authentication for Multi-domain RFID Systems Using Distributed Signatures
Abstract. The use of RFID technology in complex and distributed environments often leads to a multi-domain RFID system in which security issues such as authentication of tags and r...
Michael Braun, Ulrike Meyer, Susanne Wetzel
ACISP
2005
Springer
14 years 4 months ago
Group Signature Schemes with Membership Revocation for Large Groups
Group signature schemes with membership revocation have been intensively researched. However, signing and/or verification of some existing schemes have computational costs of O(R)...
Toru Nakanishi, Fumiaki Kubooka, Naoto Hamada, Nob...
CANS
2006
Springer
90views Cryptology» more  CANS 2006»
14 years 2 months ago
Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
Sujing Zhou, Dongdai Lin
ACNS
2004
Springer
167views Cryptology» more  ACNS 2004»
14 years 2 months ago
A Fully-Functional Group Signature Scheme over Only Known-Order Group
The concept of group signature allows a group member to sign message anonymously on behalf of the group. In the event of a dispute, a designated entity can reveal the identity of a...
Atsuko Miyaji, Kozue Umeda