How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
A communication-privacy tradeoff for modular addition
Information Processing Letters
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On construction of k-wise independent random variables
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Private Computations Over the Integers
SIAM Journal on Computing
Bounds on tradeoffs between randomness and communication complexity
Computational Complexity
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Randomness in Distributed Protocols
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On the Number of Random Bits in Totally Private Computation
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Amortizing randomness in private multiparty computations
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
| Hi-index | 0.00 |