CLOS02. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable twoparty and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail Self-citation (Ostrovsky Sahai) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In proceedings of STOC '02, pages 494--503, 2002. Full paper available at http://eprint.iacr.org/2002/140.
Cryptography in the Multi-string Model - Jens Groth Rafail Self-citation (Ostrovsky) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable twoparty and multi-party secure computation. In proceedings of STOC '02, pages 494--503, 2002. Full paper available at http://eprint.iacr.org/2002/140.
Universally Composable Security with Global Setup - Ran Canetti Yevgeniy Self-citation (Canetti) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In Proc. of STOC, pp. 494--503, 2002.
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (2005) (7 citations) Self-citation (Ostrovsky Sahai) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In proceedings of STOC '02, pages 494--503, 2002. Full paper available at http://eprint.iacr.org/2002/140.
Round Efficiency of Multi-Party Computation with a.. - Katz, Ostrovsky, Smith (2003) Self-citation (Ostrovsky) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation. In 34th ACM Symposium on the Theory of Computing, pages 494-503, Montreal, Quebec, May 2002. ACM.
Protocol Initialization for the Framework of Universal.. - Barak, Lindell, Rabin (2004) Self-citation (Lindell) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
General Composition and Universal Composability in Secure.. - Lindell (2003) (6 citations) Self-citation (Lindell) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494--503, 2002. 26
Universally Composable Zero-Knowledge Arguments and - Commitments From Signature (Correct)
No context found.
CLOS02. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable twoparty and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC
Comparing Two Notions of Simulatability - Dennis Hofheinz And (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 494--503. ACM Press, 2002. Extended abstract, full version online available at http://eprint.iacr.org/2002/140.ps.
On the Relationships between Notions of.. - Datta, Küsters.. (2006) (1 citation) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable twoparty and multi-party secure computation. In Proc. ACM Symp. on the Theory of Computing, pages 494--503, 2002.
On the (Im-)Possibility of Extending Coin Toss - Hofheinz, Müller-Quade, Unruh (2006) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 494503. ACM Press, 2002. Extended abstract, full version online available at http://eprint.iacr.org/2002/140.ps.
Provably Secure Ubiquitous Systems: Universally.. - Burmester, van Le.. (2006) (2 citations) (Correct)
No context found.
CANETTI, R., LINDELL, Y., OSTROVSKY, R., AND SAHAI, A. Universally composable two-party and multi-party secure computation. In Proc. ACM Symp. on Theory of Computing (STOC 2002.
On Fairness in Simulatability-based Cryptographic Systems - Backes, Hofheinz.. (2005) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC
Conditional Reactive Simulatability - Backes, Dürmuth, Hofheinz, Küsters (2006) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC
Achieving Fairness in Private Contract - Negotiation Keith Frikken (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In Proceedings of the thiryfourth annual ACM symposium on Theory of computing, pages 494--503. ACM Press, 2002.
A Sender Verifiable Mix-Net and a New Proof of a Shuffle - Wikström (2005) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally Composable Two-Party and Multi-Party Secure Computation, 34th STOC, pp. 494-503, 2002.
Comparing Two Notions of Simulatability - Hofheinz, Unruh (2005) (1 citation) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pages 494--503. ACM Press, 2002. Extended abstract, full version online available at http://eprint.iacr.org/2002/140.ps.
Universally Composable Zero-Knowledge Arguments and.. - Hofheinz.. (Correct)
No context found.
CLOS02. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable twoparty and multi-party secure computation. In 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC
The Impossibility of Realizable Ideal Functionality - Datta, Derek, Mitchell.. (2005) (1 citation) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In STOC '02: Proceedings of the 34th annual ACM symposium on Theory of computing, pages 494--503. ACM Press, 2002.
Foundations of Cryptography - Goldreich (2004) (50 citations) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In 34th ACM Symposium on the Theory of Computing, pages 494-503, 2002.
Unifying Equivalence-Based Definitions of Protocol.. - Datta, Küsters.. (2004) (1 citation) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multiparty secure computation. In Proc. ACM Symp. on the Theory of Computing, pages 494-503, 2002.
Possible Attacks on and Countermeasures for Secure.. - Endsuleit, Wagner (2004) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovski, and Amit Sahai. Universally composable two-party and multi-party secure computation. In Proc. of the thirty-fourth annual ACM symposium on Theory of computing, pages 494--503, 2002.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, pages 494--503, Montreal, Quebec, Canada, 2002.
Symmetric Encryption in Automatic Analyses for Confidentiality.. - Laud (2004) (18 citations) (Correct)
No context found.
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, pages 494--503, Montreal, Quebec, May 2002. ACM.
Concurrent/Resettable Zero-Knowledge with Concurrent Soundness in.. - Zhao (2003) (Correct)
No context found.
R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In ACM Symposium on Theory of Computing, pages 494-503, 2002.
First 50 documents
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