B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In Proc. 43rd FOCS, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bounded-Concurrent Secure Two-Party Computation Without Setup.. - Lindell (2003) (3 citations) (Correct)
....the domain sampler is hard to invert, even given the random coins used by the sampler; see [21, Appendix C] We note that the construction of [25] for secure two party computation in the stand alone model assumes the existence of enhanced trapdoor permutations. We note that the recent result of [2] for non malleable coin tossing does not solve this problem. This is because [2] relies on a very specific scheduling which can be enforced in their scenario, but cannot be enforced here. protocol of [35, 37] while the other party proves using the non black box zero knowledge protocol of [1, ....
....see [21, Appendix C] We note that the construction of [25] for secure two party computation in the stand alone model assumes the existence of enhanced trapdoor permutations. We note that the recent result of [2] for non malleable coin tossing does not solve this problem. This is because [2] relies on a very specific scheduling which can be enforced in their scenario, but cannot be enforced here. protocol of [35, 37] while the other party proves using the non black box zero knowledge protocol of [1, 3] It turns out that a careful choice of parameters for these protocols solves the ....
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In 43rd FOCS, pages 345--355, 2002.
Strengthening Zero-Knowledge Protocols using Signatures - Garay, MacKenzie, Yang (2003) (7 citations) (Correct)
....protocols work in the common reference string model, and consist of three rounds and constant number of exponentiations. However, since the witness extractor uses rewinding, the resulting protocols were only proven secure in a concurrent setting with the introduction of timing constraints. Barak [2] gives a construction of constant round, one time non malleable ZK protocols in the plain model. His construction uses a non blackbox proof of security and is not very efficient. Sahai [51] provides a definition for one time non malleability in the case of non interactive ZK (NIZK) proofs. De ....
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In 43rd IEEE Symp. on Foundations of Computer Sci., pp. 345--355, 2002
Zero-Knowledge twenty years after its invention - Goldreich (2002) (4 citations) (Correct)
.... before in the cryptographic setting, but they were used in the more natural context of devising an attack on an (artificial) insecure scheme (e.g. towards proving the failure of the Random Oracle Methodology [27] and the impossibility of software obfuscation [10] In contrast, in [7] and [8]) the code of the adversary is being used within a sophisticated proof of security. What we wish to highlight here is that non black box usage of programs is relevant also to proving (rather than to disproving) the security of systems. The protocol depends on the polynomial bounding the number ....
B. Barak. Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. In 43th IEEE Symposium on Foundations of Computer Science, to appear, 2002.
Concurrent Non-Malleable Zero Knowledge - Boaz Barak Department (2006) Self-citation (Barak) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In Proc. 43rd FOCS, 2002.
How to Play ANY Mental Game over the Net - Concurrently.. - Barak, Sahai (2005) Self-citation (Barak) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In Proc. 43rd FOCS. IEEE, 2002. Preliminary full version available on http://www.math.ias.edu/ # boaz.
Tight Bounds for Unconditional Authentication Protocols in.. - Naor, Segev, Smith (2006) (1 citation) (Correct)
No context found.
B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In Proceedings of the 43rd Symposium on Foundations of Computer Science, pages 345--355, 2002.
Provably Secure Substitution of Cryptographic Tools - Lea Kissner Leak (2006) (Correct)
No context found.
B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In Foundations of Computer Science (FOCS), 2002.
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) (Correct)
No context found.
B. Barak. Constant-round Coin Tossing with a Man in the Middle or Realizing the Shared Random String Model. In Proc. of IEEE FOCS'02, pp.345-355, 2002.
On the Minimal Assumptions of Group Signature Schemes - Abdalla, Warinschi (2004) (1 citation) (Correct)
No context found.
B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In 43rd Annual Symposium on Foundations of Computer Science, pages 345--355, Vancouver, British Columbia, Canada, Nov. 16-- 19, 2002. IEEE Computer Society Press.
Identity-Based Zero-Knowledge - Jonathan Katz Rafail (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. FOCS 2002.
Session-Key Generation Using Human Passwords Only - Goldreich, Lindell (2005) (24 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In the 43rd IEEE Symposium on the Foundations of Computer Science, pages 345--355, 2002.
Foundations of Cryptography - Goldreich (2004) (50 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. In 43th IEEE Symposium on Foundations of Computer Science, pages 345-355, 2002.
General Composition and Universal Composability in Secure.. - Lindell (2003) (6 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In 43rd FOCS, pages 345--355, 2002.
Concurrent/Resettable Zero-Knowledge with Concurrent Soundness in.. - Zhao (2003) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In IEEE Symposium on Foundations of Computer Science, pages , 2002.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing with a Man-in-the-Middle or Realizing the Shared Random String Model. 43rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 345--355, 2002.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin-Tossing with a Man-in-the-Middle or Realizing the Shared Random String Model. 43rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 345--355, 2002.
Notions of Reducibility between Cryptographic Primitives - Reingold, Trevisan, Vadhan (2004) (2 citations) (Correct)
No context found.
Boaz Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. Cryptology ePrint Archive, 2002.
Efficient and Non-Malleable Proofs of Plaintext Knowledge and.. - Katz (2002) (2 citations) (Correct)
No context found.
B. Barak. Constant-Round Coin Tossing with a Man in the Middle or Realizing the Shared Random String Model. Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, IEEE, 2002, pp. 345--355.
Multi-trapdoor Commitments and their Applications to Proofs of.. - Gennaro (2004) (3 citations) (Correct)
No context found.
B. Barak. Constant-round Coin Tossing with a Man in the Middle or Realizing the Shared Random String Model. Proc. of 43 pp.345--355, 2001.
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