Results 1  10
of
4,613
Efficient Privatization of Random Bits
 In Workshop on Randomized Algorithms
, 1997
"... The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols. This process is called privatization of random bits. We consider the case in which the party privatizing random bits has a small num ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols. This process is called privatization of random bits. We consider the case in which the party privatizing random bits has a small
Recycling Random Bits in Parallel
"... We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact that t ..."
Abstract
 Add to MetaCart
We show that r pseudorandom bits can be obtained by concatenating t blocks of r=t pseudorandom bits, where the blocks are generated in parallel. This can be considered as a parallel version of [8]  recycling random bits by doing a random walk on an expander. The proof is based on the fact
How to Privatize Random Bits
 In Proceedings 10th International Conference on Parallel and Distributed Computing Systems
, 1996
"... The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols. We consider two cases: (a) the case in which the part privatizing random bits is computationally more powerful than the adversary, a ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The paper investigates the extent to which a public source of random bits can be used to obtain private random bits that can be safely used in cryptographic protocols. We consider two cases: (a) the case in which the part privatizing random bits is computationally more powerful than the adversary
Pseudo Random Bit Generation
, 2007
"... 1.1 Randomness versus unpredictability............................................................................... 3 1.2 Generating randomness.................................................................................................... 3 ..."
Abstract
 Add to MetaCart
1.1 Randomness versus unpredictability............................................................................... 3 1.2 Generating randomness.................................................................................................... 3
A Universal Statistical Test for Random Bit Generators
 Journal of cryptology
, 1992
"... A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be mo ..."
Abstract

Cited by 85 (0 self)
 Add to MetaCart
A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can
Results 1  10
of
4,613