20 search results - page 3 / 4 » Primality Proving Using Elliptic Curves: An Update |
CTRSA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
TIT
2008
13 years 6 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
WISEC
2009
ACM
14 years 1 months ago
2009
ACM
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
SCN
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...