Sciweavers

53 search results - page 5 / 11
» crypto 2000
Sort
View
CRYPTO
2000
Springer
91views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
An Improved Pseudo-random Generator Based on Discrete Log
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...
Rosario Gennaro
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
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 ...
Palash Sarkar, Subhamoy Maitra
CRYPTO
2000
Springer
184views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
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...
Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene ...
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
On the Exact Security of Full Domain Hash
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...
Jean-Sébastien Coron
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
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...
Alon Rosen