56 search results - page 10 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
102
click to vote
AAECC
2005
Springer
14 years 11 months ago
2005
Springer
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
108
Voted
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
CSI
2007
14 years 11 months ago
2007
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
AINA
2004
IEEE
15 years 3 months ago
2004
IEEE
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can commun...
116
click to vote
ISCI
2008
14 years 11 months ago
2008
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...