53 search results - page 5 / 11 » crypto 2000 |
127
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
169
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
164
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator ca...
130
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
179
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...