140 search results - page 13 / 28 » Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi... |
CARDIS
1998
Springer
15 years 2 months ago
1998
Springer
In this paper we describe new secure personalization schemes using proxy cryptography. We first introduce the context of a large scale smart card application such as an electronic ...
IH
1999
Springer
15 years 2 months ago
1999
Springer
The new watermarking technique1 presented in this paper is an example of an asymmetric public detection scheme. The detection process does not need the original picture nor the sec...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
TCC
2010
Springer
15 years 6 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
CTRSA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...