Sciweavers

55 search results - page 5 / 11
» On the Minimal Assumptions of Group Signature Schemes
Sort
View
124
Voted
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
15 years 3 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
79
Voted
EUROCRYPT
2004
Springer
15 years 2 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
SCN
2010
Springer
147views Communications» more  SCN 2010»
14 years 8 months ago
Group Message Authentication
Group signatures is a powerful primitive with many practical applications, allowing a group of parties to share a signature functionality, while protecting the anonymity of the si...
Bartosz Przydatek, Douglas Wikström
104
Voted
JOC
2006
116views more  JOC 2006»
14 years 9 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
ICALP
2005
Springer
15 years 3 months ago
Hierarchical Group Signatures
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
Mårten Trolin, Douglas Wikström