A. G'al, and A. Ros'en, "A Theorem on Sensitivity and Applications in Private Computation". In Proc. of the 31st Ann. ACM Symposium on the Theory of Computing, May 1999. To Appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
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 ....
....research topic is the design of randomness e#cient private protocols, and the quantification of the amount of randomness needed to perform private computations of various functions and under various constraints. This line of research has received considerable attention in recent years, see e.g. [24, 19, 22, 16, 6, 7, 9, 23]. This study also showed that the randomness complexity of the private computation of a function is related to other complexity measures, such as sensitivity and circuit size [24, 22, 16, 6, 23] The specific function xor (addition modulo 2) was the subject of considerable research in this context ....
[Article contains additional citation context not shown here]
A. Gal, and A. Rosen, "A Theorem on Sensitivity and Applications in Private Computation". SIAM Jour. on Computing, Vol. 31, No. 5, pp. 1424--1437, 2002.
Amortizing Randomness in Private Multiparty Computations - Kushilevitz, Ostrovsky.. (1998) (1 citation) Self-citation (Ros'en) (Correct)
No context found.
A. G'al, and A. Ros'en, "A Theorem on Sensitivity and Applications in Private Computation". In Proc. of the 31st Ann. ACM Symposium on the Theory of Computing, May 1999. To Appear.
Lower Bounds on the Amount of Randomness in Private Computation - Gal, Rosén (2003) (Correct)
No context found.
A. G'al, and A. Ros'en, "A Theorem on Sensitivity and Applications in Private Computation". SIAM Jour. on Computing, Vol. 31, No. 5, pp. 1424--1437, 2002.
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