How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on 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
On the extended direct sum conjecture
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of 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 Constants
SIAM Journal on Discrete Mathematics
On construction of k-wise independent random variables
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fractional Covers and Communication Complexity
SIAM Journal on Discrete Mathematics
Private Computations Over the Integers
SIAM Journal on Computing
Amortized Communication Complexity
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
Randomness in distribution protocols
Information and Computation
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On the Dealer‘s Randomness Required in Secret Sharing Schemes
Designs, Codes and Cryptography
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Randomness-Rounds Tradeoff in Private Computation
SIAM Journal on Discrete Mathematics
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th 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
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomness Recycling in Constant-Round Private Computations (extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Lower bounds on the amount of randomness in private computation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |