M. Bellare, R. Impagliazzo, and M. Naor, Does parallel repetition reduce the error in computationally sound protocols?, Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 374-383. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Magic Functions - Dwork, Naor, Reingold, Stockmeyer (1999) (4 citations) Self-citation (Naor) (Correct)
.... is easy to sample (for any edge, the corresponding plaintexts are just two di erent random colors in f1; 2; 3g) Running this 3 round argument in parallel rapidly improves its soundness (the error essentially decreases exponentially fast in the number of executions) This can be deduced from [3] and can also be derived directly using simpler combinatorial arguments. 39 3. We can assume wlog that the sequence of plaintexts P commits to in the rst round completely de nes the witness y (this is not really necessary but it simpli es the proof) One way to achieve this is to assume that ....
M. Bellare, R. Impagliazzo, and M. Naor, Does parallel repetition reduce the error in computationally sound protocols?, Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 374-383.
The UCSD Active Web - Pasquale (1997) Self-citation (Bellare Impagliazzo) (Correct)
No context found.
M. Bellare, R. Impagliazzo, and M. Naor, "Does parallel repetition reduce the error in computationally sound protocols?" In Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.
Magic Functions - Dwork, Naor, Reingold, Stockmeyer (2000) (4 citations) Self-citation (Naor) (Correct)
.... n ; Z 0 n ) Gamma Pr D 0 n [R 0 (X 0 n ; Y 0 n ; Z 0 n ; M 0 (X 0 n ; Z 0 n ) j 1 n c 9 Running this 3 round argument in parallel rapidly improves its soundness (the error essentially decreases exponentially fast in the number of executions) This can be deduced from [3] and can also be derived directly using simpler combinatorial arguments. 41 (where we explicitly note the distribution D 0 n to remind the reader of the distribution on the inputs, remembering that the probabilities are also over all coin flips of all machines involved) We will now derive a ....
M. Bellare, R. Impagliazzo, and M. Naor, Does parallel repetition reduce the error in computationally sound protocols?, Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 374--383.
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