121 search results - page 2 / 25 » An Efficient and Secure Cryptosystem for Encrypting Long Mes... |
ICICS
2010
Springer
13 years 3 months ago
2010
Springer
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
NDSS
1998
IEEE
13 years 9 months ago
1998
IEEE
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO '07), who provided the "strongest possible" notion of security for...