Sciweavers

6 search results - page 2 / 2
» An Efficient Tree-Based Group Key Agreement Using Bilinear M...
Sort
View
CCS
2008
ACM
13 years 7 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki