R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In 28th Annual ACM Symposium on Theory of Computing (STOC), 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Round Complexity of Verifiable Secret Sharing.. - Gennaro, Ishai.. (2001) (8 citations) (Correct)
....between our model and the computational one is not that signi cant. Moreover, in the general context of secure multi party computation, information theoretic VSS provides better round eciency than the alternative zeroknowledge proof methodology on which most computationally secure protocols rely [30, 5, 15]. Indeed, as noted above, our results can be used to improve the exact round complexity of computationally secure protocols which rely on information theoretic VSS (such as [6] Multicast is a very important practical problem in many of today s Internet applications (e.g. video on demand, news ....
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In Proc. 28th STOC, pp. 639-648.
A Separation between the Random-Oracle Model and the.. - Bellare, Boldyreva.. (2003) (2 citations) (Correct)
....such results are due to Canetti, Goldreich and Halevi [6] the goals in question being IND CPA secure asymmetric encryption and digital signatures secure against chosen message attack. Nielsen [17] followed with a separation result for the goal of non interactive, non committing encryption (NCE) [5]. However, the schemes of [6] are somewhat arti cial (meaning, not like practical schemes one typically encounters) and also complex through the use of CS proofs [16] The scheme of [17] on the other hand, is natural but the goal considered (namely, non interactive NCE) is not as practical as ....
....CS proof based one. In our separation results, both the scheme and the goal are natural and practical. Let us begin by describing the goal. An additional concern is that Nielsen s separation [17] might be the result of having incorrectly lifted the standardmodel de nition of the NCE goal [5] to the random oracle model. We recall that the de nition of NCE is in Canetti s multi party computation framework [4] which uses the notion of an environment. In moving to the RO model, Nielsen denies the random oracle to the environment. But the de nition of the RO model is that all ....
R. Canetti, U. Feige, O. Goldreich and M. Naor, \Adaptively secure multi-party computation, " Proceedings of the 28th Annual Symposium on the Theory of Computing, ACM, 1996.
On Privacy and Partition Arguments - Chor, Ishai (Correct)
....the subject of a considerable amount of work, originating from [11, 8, 2, 4] The model considered here is a minimalistic one, referred to as the model of honest but curious parties, in the information theoretic setting. Stronger adversarial scenarios, including Byzantine [2, 4] and adaptive [3] adversaries, have been studied in the literature. Negative results on private computation in our model hold in the more adversarial (information theoretic) models as well. The seminal works of [2, 4] showed that all n argument functions over nite domains X i can be computed b 2 c privately. In ....
....such that f attains the same value on all m vectors uj i d , 1 d m. The function f is called non separable if it is non separable at each of its n coordinates. Any constant function is clearly non separable. As a less trivial example, Figure 1 describes a speci c function g, whose domain is [3] . This function is non separable, as g(1; 1; 1) g(2; 1; 1) g(3; 1; 1) g(2; 1; 2) g(2; 2; 2) g(2; 3; 2) and g(3; 3; 1) g(3; 3; 2) g(3; 3; 3) Lemma 4.1. If f : m] Z is a non constant non separable function, then f is not fully private. Proof. The following proof ....
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In Proc. of 28th STOC, pages 639-648, 1996.
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (24 citations) (Correct)
....even when composed with any other set of protocols that may be running concurrently in the same system. It is known that any ideal functionality can be securely realized in a universally composable way using standard constructions, as long as a majority of the participants remain uncorrupted [3, 44, 11, 10]. However, this result does not hold when half or more of the parties may be corrupted. In particular, it does not hold for the important case of twoparty protocols, where each party wishes to maintain its security even if the other party is corrupted. In fact, it was shown in [12, 10] that a ....
....commitment protocol in the CRS model, assuming only existence of trapdoor permutations. UC commitment protocols are protocols that securely realize the ideal commitment functionality [12] Existing constructions [12, 17] are based on stronger computational assumptions. Our scheme uses tools from [35, 26, 11, 12, 23, 46]. Next, plugging the new scheme into the UC zero knowledge protocol of [12] which assumes access to the ideal commitment functionality) we obtain an adaptively secure UC zero knowledge protocol in the CRS model, for any NP relation, and based on any trapdoor permutation. Here multiple proof ....
[Article contains additional citation context not shown here]
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. STOC 96.
Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999) Self-citation (Canetti) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively Secure MultiParty Computation", Proc. of 28th STOC, 1996, pp. 639--648.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) Self-citation (Canetti Goldreich) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-party Computation. In 28th ACM Symposium on the Theory of Computing, pages 639--648, 1996.
Foundations of Cryptography - Goldreich (2004) (50 citations) Self-citation (Goldreich) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-party Computation. In 28th ACM Symposium on the Theory of Computing, pages 639-648, 1996.
On the Limitations of Universally Composable Two-Party .. - Canetti, Kushilevitz, .. (2004) (7 citations) Self-citation (Canetti) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. In 28th STOC, pages 639--648, 1996.
Secure Multi-Party Computation - Goldreich (1998) (149 citations) Self-citation (Canetti Goldreich) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-party Computation. In 28th ACM Symposium on the Theory of Computing, pages 639--648, 1996.
Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2003) (24 citations) Self-citation (Canetti) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. In 28th STOC, pages 639--648, 1996.
On Expected Constant-Round Protocols for Byzantine Agreement - Katz, Koo (2006) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In 28th Annual ACM Symposium on Theory of Computing (STOC), 1996.
APSS: Proactive Secret Sharing in Asynchronous Systems - Zhou, Schneider, van Renesse (2002) (7 citations) (Correct)
No context found.
CANETTI, R., FEIGE,U.,GOLDREICH,O.,AND NAOR,M. 1996. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM Press, New York, 639--648.
General Secure Multi-Party Computation from any Linear .. - Cramer.. (2000) (32 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, Proc. ACM STOC '96, pp. 639--648.
On Codes, Matroids and Secure Multi-Party.. - Cramer, Daza.. (2004) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, M. Naor. Adaptively secure multi-party computation. Proc. ACM STOC'96 (1996) 639--648.
Multiparty Computations - Information-Theoretically Secure.. - Dziembowski (2001) (1 citation) (Correct)
No context found.
Ran Canetti, Uriel Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In ACM Symposium on Theory of Computing, pages 639--648, 1996.
Binary Tree Encryption: Constructions and Applications - Katz (2003) (1 citation) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively Secure Multi-Party Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639--648, 1996.
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
No context found.
Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In 28th Annual ACM Symposium on the Theory of Computing (STOC), 1996.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 639--648, Philadelphia, Pennsylvania, 22--24 May 1996.
Public-Key Steganography - von Ahn, Hopper (2003) (8 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-party Computation. 28th Symposium on Theory of Computing (STOC '96), pages 639-648. 1996.
Symmetric Encryption in a Simulatable Dolev-Yao Style.. - Backes, Pfitzmann (2004) (14 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In Proc. 28th Annual ACM Symposium on Theory of Computing (STOC), pages 639--648, 1996.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively-Secure Multiparty Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639--648, 1996.
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (7 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively-Secure Multiparty Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639--648, 1996.
Public-Key Steganography - von Ahn, Hopper (2003) (8 citations) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-party Computation. 28th Symposium on Theory of Computing (STOC '96), pages 639-648. 1996.
Towards Secure Privacy Preserving Data Mining Over.. - Ahmad, Khokhar (2003) (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich and M. Naor, Adaptively Secure Multi-party Computation, TR682, LCS/MIT, 1996.
New Bounds for Randomized Busing - Steven Seiden Peter (Correct)
No context found.
R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (May 1996), pp. 639--648.
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