B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages 62--72. ACM Press, 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Lower Bounds on the Amount of Randomness in Private Computation - Gal, Rosen (2003) (Correct)
....the protocol, except what is implied by the value of f(#x) and the inputs of the members of the coalition. In particular, the members of the coalition do not learn anything about the inputs of the other players. Private computation in this setting was the subject of considerable research, see e.g. [2, 3, 4, 5, 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, 26]. Randomness is necessary to perform private computations involving more than two players (except for the computation of very degenerate functions) That is, the players must have access to a random source. As randomness is regarded as a scarce resource, methods for saving random bits in various ....
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, 36--47, 1991.
A Theorem on Sensitivity and Applications in Private Computation - Gál, Rosén (Correct)
.... value of the function f on their combined input, in a way that no single player learns any unnecessary information (in particular, the inputs of the other players) Private computation in this setting was first considered by Yao [36] and has been the subject of considerable amount of research [1, 2, 4, 5, 7, 8, 9, 12, 13, 16, 21, 22, 23]. Using randomness any function can be computed privately if the number of players is at least 3. On the other hand, for most functions (except very simple ones) randomness is necessary in order to compute the function privately. Randomness as a resource has been the subject of extensive ....
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", SIAM J. Disc. Math. Vol. 4, 36--47, 1991.
Cryptography from Anonymity - Yuval Ishai Eyal Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. SIAM J. Discrete Math 4(1): 36-47, 1991. Earlier version in STOC '89.
Cryptography from Anonymity - Ishai, Kushilevitz, Ostrovsky, Sahai (2006) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy (extended abstract). In Proc. STOC 1989, pages 62-72.
Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIDMA, Vol. 4, 36--47, 1991.
Amortizing Randomness in Private Multiparty Computations - Kushilevitz, Ostrovsky.. (1998) (1 citation) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, (1991), 36--47.
Amortizing Randomness in Private Multiparty Computations - Kushilevitz, Ostrovsky, Rosen (2002) (1 citation) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, (1991), 36--47.
A Randomness-Rounds Tradeoff in Private Computation - Kushilevitz, Rosen (8 citations) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, (1991), 36--47.
Characterizing Linear Size Circuits in Terms of Privacy - Kushilevitz, Ostrovsky, Rosen (1996) (5 citations) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, 36--47, 1991.
On the Limitations of Universally Composable Two-Party .. - Canetti, Kushilevitz, .. (2004) (7 citations) Self-citation (Kushilevitz) (Correct)
No context found.
B. Chor, and E. Kushilevitz. A Zero-One Law for Boolean Privacy. In 21st STOC, pages 62--72, 1989.
Unconditional Privacy in Social Choice - Felix Brandt Computer (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages 62--72. ACM Press, 1989.
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages 36--47. ACM Press, 1989.
Lower Bounds on the Amount of Randomness in Private Computation - Gal, Rosén (2003) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", STOC 89 and SIAM J. Disc. Math. Vol. 4, 36--47, 1991.
A Theorem on Sensitivity and Applications in Private Computation - Gal, Rosen (2002) (2 citations) (Correct)
No context found.
B. Chor, and E. Kushilevitz, "A Zero-One Law for Boolean Privacy", SIAM J. Disc. Math. Vol. 4, 36--47, 1991.
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages 36--47. ACM Press, 1989.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) (Correct)
No context found.
B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. SIAM J. on Disc. Math., Vol. 4, pages 36--47, 1991.
Foundations of Cryptography - Goldreich (2004) (50 citations) (Correct)
No context found.
B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. SIAM J. on Disc. Math., Vol. 4, pages 36-47, 1991.
On Correctness and Privacy in Distributed Mechanisms - Brandt, Sandholm (2004) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proc. of 21st STOC, pages 36--47. ACM Press, 1989.
On Quantum and Approximate Privacy - Klauck (2003) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM Journal Discrete Math., vol. 4, pp. 36-47, 1991.
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages 36--47. ACM Press, 1989.
A Minimal Model for Secure Computation - Extended Uri (Correct)
No context found.
B. Chor and E. Kushilevitz, A zero-one law for Boolean privacy, Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 61--72.
Completeness in Two-Party Secure Computation - A.. - Harnik, Naor.. (2004) (2 citations) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM Journal on Disc. Math., 4(1):36--47, 1991. preliminary version in STOC 89.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) (Correct)
No context found.
B. Chor and E. Kushilevitz. A Zero-One Law for Boolean Privacy. SIAM J. on Disc. Math., Vol. 4, pages 36--47, 1991.
Completeness in Two-Party Secure Computation Revisited - Harnik, Naor, Reingold, Rosen (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM Journal on Disc. Math., 4(1):36--47, 1991.
On Correctness and Privacy in Distributed Mechanisms - Brandt, Sandholm (2004) (Correct)
No context found.
B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proc. of 21st STOC, pages 36--47. ACM Press, 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC