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
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
Bounds on tradeoffs between randomness and communication complexity
Computational Complexity
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
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Random polynomial time is equal to slightly-random polynomial time
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Private computations over the integers
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Randomness in interactive proofs
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
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 Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Recycling random bits in composed perfect zero-knowledge
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography
| Hi-index | 0.01 |
We study the role of randomness in multi-party private computations. In particular, we give several results that prove the existence of a randomness-rounds tradeoff in multi-party private computation of xor. We show that with a single random bit, 驴(n) rounds are necessary and sufficient to privately compute xor of n input bits. With d 驴 2 random bits, 驴(log n/d) rounds are necessary, and O(log n/ log d) are sufficient.More generally, we show that the private computation of a boolean function. f, using d 驴 2 random bits, requires 驴(log S(f)/d) rounds, where S(f) is the sensitivity of f. Using a single random bit, 驴(S(f)) rounds are necessary.