Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Realistic analysis of some randomized algorithms
Journal of Computer and System Sciences
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Primality testing with fewer random bits
Computational Complexity
Communications of the ACM
On the Impossibility of Private Key Cryptography with Weakly Random Keys
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Privacy Amplification Secure Against Active Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the (Im)possibility of Cryptography with Imperfect Randomness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Derandomization of Sparse Cyclotomic Integer Zero Testing
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
Random polynomial time is equal to slightly-random polynomial time
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Independent Unbiased Coin Flips From A Correlated Biased Source: A Finite State Markov Chain
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient Traitor Tracing from Collusion Secure Codes
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Derandomization of Euclidean Random Walks
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Does privacy require true randomness?
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Derandomized constructions of k-wise (almost) independent permutations
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
How to turn loaded dice into fair coins
IEEE Transactions on Information Theory
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
A mathematical problem for security analysis of hash functions and pseudorandom generators
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
| Hi-index | 0.00 |
Dubrov and Ishai (STOC 2006) revealed, by generalizing the notion of pseudorandom generators (PRGs), that under a computational assumption, randomness in a protocol can be replaced with pseudorandomness in an indistinguishable way for an adversary even if his algorithm has unbounded complexity. However, their argument was applied only to some special protocols. In this article, we first show that their argument is not effective for a wide class of more general protocols. Then we propose a novel evaluation technique for such indistinguishability that is based on usual PRGs and is effective for those more general protocols. Examples of such protocols include parallel computation over honest-but-curious modules, secret sharing, broadcast encryption, traitor tracing, and collusion-secure codes.