(Enter summary)
Abstract: Consider a set of parties who do not trust each other, nor the channels by which they communicate. Still, the parties wish to correctly compute some common function of their local inputs, while keeping their local data as private as possible. This, in a nutshell, is the problem of secure multiparty computation. This problem is fundamental in cryptography and in the study of distributed computations. It takes many different forms, depending on the underlying network, on the function to be... (Update)
Cited by: More
Information-Theoretic Conditions for - Two-Party Secure Function (2006)
(Correct)
Provably Secure Ubiquitous Systems: Universally.. - Burmester, van Le.. (2006)
(Correct)
APSS: Proactive Secret Sharing in Asynchronous Systems - Zhou, Schneider, van Renesse (2002)
(Correct)
Similar documents (at the sentence level):
15.8%: Adaptively Secure Multi-party Computation - Canetti, Feige, Goldreich, Naor (1996)
(Correct)
Active bibliography (related documents): More All
0.5: Optimal Amortized Distributed Consensus - Bar-Noy, Deng, Garay, Kameda (1994)
(Correct)
0.0: Secure Multi-Party Computation - Goldreich (1998)
(Correct)
0.0: Incoercible Multiparty Computation - Canetti, Gennaro (1996)
(Correct)
Similar documents based on text: More All
0.9: Secure Computation Without a Broadcast Channel - Goldwasser, Lindell (2002)
(Correct)
0.7: General Secure Multi-Party Computation - Goldreich (1999)
(Correct)
0.6: Secure Multiparty Computation of Approximations - Feigenbaum, Ishai, Malkin.. (2001)
(Correct)
Related documents from co-citation: More All
36: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
29: Security and composition of multi-party cryptographic protocols
- Canetti - 1998
26: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
BibTeX entry: (Update)
R. Canetti. Studies in secure multiparty computation and applications. PhD Thesis, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science, May 1995. http://citeseer.ist.psu.edu/article/canetti96studies.html More
@phdthesis{ canetti96studies,
author = "Ran Canetti",
title = "Studies in Secure Multiparty Computation and Applications",
year = "1996",
url = "citeseer.ist.psu.edu/article/canetti96studies.html" }
Citations (may not include all citations):
659
Random oracles are practical: A paradigm for designing effic..
- Bellare, Rogaway - 1993
188
Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
117
The complexity of Network Synchronization (context) - Awerbuch - 1985
78
Foundations of Secure Interactive Computing (context) - Beaver - 1991
63
Receipt-Free Secret-Ballot Elections (context) - Benaloh, Tunistra - 1994
40
Cryptographic Protocols Provably secure Against Dynamic Adve.. (context) - Beaver, Haber - 1992
29
How to generate factored random numbers (context) - Bach - 1988
20
Efficiency of Synchronous Versus Asynchronous Distributed Sy.. (context) - Arjomandi, Fischer et al. - 1983
19
Asynchronous Secure Computations (context) - Ben-Or, Canetti et al. - 1993
2
Interactive Consistency in Constant Time (context) - Ben-Or, El-Yaniv - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.lcs.mit.edu.html): More
Studies in Secure Multiparty Computation and Applications - Canetti (1995)
(Correct)
Machine Learning (Lecture notes 13) - Rivest (1994)
(Correct)
Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994)
(Correct)
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