Add to ORKGWe show very efficient constructions for a pseudo-random generator and for a universal one-way hash function based on the intractability of the subset sum problem for certain dimensions. (Pseudo-random generators can be used for private key encryption and universal one-way hash functions for signature schemes). The increase in efficiency in our construction is due to the fact that many bits can be generated/hashed with one application of the assumed one-way function. All our construction can be implemented in NC using an optimal number of processors
We show that for a random choice of the parameters, the subset sum pseudorandom number generator pro...
We present a method for converting shares of a secret into shares of the same secret in a different ...
Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this...
We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some ...
We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some ...
simple and very fast methods for generating randomly distributed pairs of the form (x, g x mod p) us...
We present lower bounds on the efficiency of constructions for Pseudo-Random Generators (PRGs) and U...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
Abstract. We present a pseudo-random bit generator expanding a uniformly random bit-string r of leng...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
Abstract We study the parallel time-complexity of basic crypto-graphic primitives such as one-way fu...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
The security offered by symmetric cryptosystems based on the arithmetic coding algorithm is examined...
We describe efficient constructions for various cryptographic primitives (both in privatekey and in ...
In this paper, we identify a generic construction of cryptosystems based on the subset sum problem a...
We show that for a random choice of the parameters, the subset sum pseudorandom number generator pro...
We present a method for converting shares of a secret into shares of the same secret in a different ...
Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this...
We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some ...
We show how to accelerate the subset sum pseudorandom number generator with arbitrary weights. Some ...
simple and very fast methods for generating randomly distributed pairs of the form (x, g x mod p) us...
We present lower bounds on the efficiency of constructions for Pseudo-Random Generators (PRGs) and U...
The question of how to construct optimally efficient secure protocols is a central question in crypt...
Abstract. We present a pseudo-random bit generator expanding a uniformly random bit-string r of leng...
Abstract. We describe efficient constructions for various cryptographic primitives in private-key as...
Abstract We study the parallel time-complexity of basic crypto-graphic primitives such as one-way fu...
and Luby show that a pseudorandom generator can be constructed from any one-way function. This plaus...
The security offered by symmetric cryptosystems based on the arithmetic coding algorithm is examined...
We describe efficient constructions for various cryptographic primitives (both in privatekey and in ...
In this paper, we identify a generic construction of cryptosystems based on the subset sum problem a...
We show that for a random choice of the parameters, the subset sum pseudorandom number generator pro...
We present a method for converting shares of a secret into shares of the same secret in a different ...
Many implementations of secure computation use fixed-key AES (modeled as a random permutation); this...