Sciweavers

27 search results - page 2 / 6
» Security Analysis of the Strong Diffie-Hellman Problem
Sort
View
TC
2008
13 years 4 months ago
On the Computational Security of a Distributed Key Distribution Scheme
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
Vanesa Daza, Javier Herranz, Germán S&aacut...
CIC
2006
114views Communications» more  CIC 2006»
13 years 6 months ago
Tree Based Conference Key Establishment Cost Analysis and Minimization in Heterogeneous Networks
A shared secret, conference key, must be established among members to securely communicate among them. The Diffie-Hellman is often used for the conference key establishment. In a ...
Zhan Liu, Mi Lu
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 4 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
CCS
2008
ACM
13 years 6 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
EUROCRYPT
2000
Springer
13 years 8 months ago
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
We exhibit an attack against a signature scheme recently proposed by Gennaro, Halevi and Rabin [9]. The scheme's security is based on two assumptions namely the strong RSA ass...
Jean-Sébastien Coron, David Naccache