Matthew Franklin, Moti Yung  Home/Search
Context Related
| columbia.edu/~franklin/./pu...survey.ps xerox.com/csl/members/frank...survey.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: columbia.edu/~franklin/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we will see solutions to the Fortune 500 problem (or any other computational problem) that assume nothing more than that each company trusts that there are at least 333 other companies that will not betray it (plus secure phone lines). Other solutions show that if conference-calling is also allowed, then each company need only assume that 250 other companies are honest. Still other solutions need only assume that the Chief Number Theorist of each company certifies that certain... (Update)
Cited by: More
Privacy Preserving k means clustering over Vertically Partitioned .. - Vaidya (2003) (Correct)
Privacy-Preserving K-Means Clustering over Vertically.. - Vaidya, Clifton (2003) (Correct)
Privacy-Preserving Data Mining Using Multi-Group Randomized.. - Zhan, Du (Correct)
Similar documents (at the sentence level):
79.5%: An Overview of Secure Distributed Computing - Franklin, Galil, Yung (1992) (Correct)
Active bibliography (related documents): More All
6.1: Complexity and Security of Distributed Protocols - Franklin (1993) (Correct)
0.7: Cryptographic Primitives and Quantum Theory - Crépeau (1993) (Correct)
0.6: Practical Mental Poker without a TTP Based on.. - Castella-Roca.. (2003) (Correct)
Similar documents based on text: More All
0.2: Approximation Hardness And Secure Communication In Broadcast.. - Desmedt, Wang (1999) (Correct)
0.2: Secure Communication in Broadcast Channels: The Answer to.. - Wang, Desmedt (1999) (Correct)
0.2: Secure Communication in Multicast Channels: The Answer to.. - Wang, Desmedt (2000) (Correct)
Related documents from co-citation: More All
6: Privacy preserving data mining - Lindell, Pinkas - 2000
5: Privacy-preserving data mining - Agrawal, Ramakrishnan - 2000
4: Privacy-preserving distributed mining of association rules on horizontally parti.. (context) - Kantarcoglu, Clifton
BibTeX entry: (Update)
M. Franklin and M. Yung, "Varieties of secure distributed computing", Proc. Sequences II, Methods in Communications, Security and Computer Science, Positano, Italy, June 1991, 392--417. http://citeseer.ist.psu.edu/49361.html More
@misc{ franklin91varieties,
author = "M. Franklin and M. Yung",
title = "Varieties of secure distributed computing",
text = "M. Franklin and M. Yung, Varieties of secure distributed computing, Proc.
Sequences II, Methods in Communications, Security and Computer Science,
Positano, Italy, June 1991, 392--417.",
year = "1991",
url = "citeseer.ist.psu.edu/49361.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public key cry.. - Rivest, Shamir et al. - 1978
645 How to share a secret (context) - Shamir - 1979 ACM DBLP
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989 ACM DBLP
287 Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988 ACM
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
250 How to play any mental game (context) - Goldreich, Micali et al. - 1987 ACM
241 The Byzantine generals problem - Lamport, Shostak et al. - 1982 ACM DBLP
219 Completeness theorems for non-cryptographic faulttolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988 ACM DBLP
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1985 ACM DBLP
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988 ACM DBLP
187 Security without identification: Transaction systems to make.. (context) - Chaum - 1985 ACM DBLP
185 How to generate and exchange secrets (context) - Yao - 1986
182 Algebraic Coding Theory (context) - Berlekamp - 1984 ACM
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
167 Protocols for secure computations (context) - Yao - 1982
166 Some complexity questions related to distributive computing (context) - Yao - 1979
132 Hiding instances in multioracle queries (context) - Beaver, Feigenbaum - 1990 ACM DBLP
127 Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989 ACM
124 Bit commitment using pseudo-randomness - Naor - 1989 ACM DBLP
120 Secure computation (context) - Micali, Rogaway - 1991
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
109 Verifiable secret sharing and achieving simultaneity in the .. (context) - Chor, Goldwasser et al. - 1985
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988 DBLP
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1989 ACM DBLP
97 the security of public key protocols (context) - Dolev, Yao - 1981
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989 ACM DBLP
89 Untraceable electronic mail, return addresses and digital ps.. (context) - Chaum - 1981
85 On hiding information from an oracle - Abadi, Feigenbaum et al. - 1989 ACM DBLP
79 One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
79 Arthur-Merlin games: A randomized proof system and a hierarc.. (context) - Babai, Moran - 1988
78 Foundations of secure interactive computing (context) - Beaver - 1991 ACM DBLP
66 A zero-one law for boolean privacy - Chor, Kushilevitz - 1989 ACM DBLP
64 Secret sharing homomorphisms: keeping shares of a secret sec.. (context) - Benaloh ACM
59 Security with low communication overhead (context) - Beaver, Feigenbaum et al. - 1990 ACM DBLP
57 Perfectly secure message transmission (context) - Dolev, Dwork et al. - 1993 ACM DBLP
55 Information theoretic reductions among disclosure problems (context) - Brassard, Cr'epeau et al. - 1986
55 Pseudo-random generators under uniform assumptions (context) - Hastad - 1990 ACM DBLP
54 Privacy and communication complexity - Kushilevitz - 1989 ACM DBLP
54 A robust and verifiable cryptographically secure election sc.. (context) - Benaloh, Fisher - 1985
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damgard et al. - 1987
51 Random self-reducibility and zero knowledge interactive proo.. (context) - Tompa, Woll - 1987 DBLP
49 Non-cryptographic fault-tolerant computing in a constant num.. (context) - Bar-Ilan, Beaver - 1989
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990 ACM
45 Optimal algorithms for Byzantine agreement (context) - Feldman, Micali - 1988 ACM DBLP
41 Direct minimum-knowledge computation (context) - Impagliazzo, Yung - 1987
38 Perfect privacy for two-party protocols (context) - Beaver - 1990
34 Cryptographic computation: secure fault-tolerant protocols a.. (context) - Galil, Haber et al. - 1987
33 Coin flipping by telephone: a protocol for solving impossibl.. (context) - Blum - 1982
31 How to prove a theorem so no one else can claim it (context) - Blum - 1986
31 Achieving oblivious transfer using weakened security assumpt.. (context) - Cr'epeau, Kilian - 1988
30 How to solve any protocol problem -- an efficiency improveme.. - Goldreich, Vainish - 1987
30 Multiparty computation with faulty majority (context) - Beaver, Goldwasser - 1989 ACM DBLP
27 Private computations over the integers - Chor, Gereb-Graus et al. - 1990 ACM DBLP
26 Perfect zero-knowledge arguments for NP can be based on gene.. - Naor, Ostrovsky et al. - 1991
24 Fair games against an all-powerful adversary - Ostrovsky, Venkatesan et al. - 1991
23 Controlled gradual disclosure schemes for random bits and th.. (context) - Cleve - 1989 ACM DBLP
23 Equivalence between two flavours of Oblivious Transfer (context) - Cr'epeau
22 Robust sharing of secrets when the dealer is honest or cheat.. (context) - Rabin - 1988 ACM DBLP
22 A general completeness theorem for two-party games (context) - Kilian - 1991 DBLP
22 Mental poker (context) - Shamir, Rivest et al. - 1979
20 Secure circuit evaluation: a protocol based on hiding inform.. - Abadi, Feigenbaum - 1990
19 Asynchronous secure computation (context) - Ben-Or, Canetti et al. - 1993 ACM DBLP
19 How to simultaneously exchange a secret bit by flipping a sy.. (context) - Luby, Micali et al. - 1984 DBLP
19 Pseudorandom number generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
18 Limits on the security of coin flips when half the processor.. (context) - Cleve - 1986 ACM
15 Three applications of the Oblivious Transfer: Part I: Coin f.. (context) - Blum - 1981
15 Computing algebraic formulas using a constant number of regi.. (context) - Ben-Or, Cleve - 1988 ACM DBLP
14 A provably secure oblivious transfer protocol (context) - Berger, Peralta et al. - 1984 ACM DBLP
12 How to cheat at mental poker (context) - Lipton - 1981
11 Poker protocols (context) - Fortune, Merritt - 1984 ACM DBLP
10 Multiparty cryptographic computation: techniques and applica.. (context) - Haber - 1988
10 A zero-knowledge poker protocol that achieves confidentialit.. (context) - Cr'epeau - 1986
10 Privacy, additional information, and communication (context) - Bar-Yehuda, Chor et al. - 1990 DBLP
9 Mental poker with three or more players (context) - Barany, Furedi - 1983 ACM DBLP
7 How to exchange (secret) keys (context) - Blum - 1983 ACM DBLP
7 Cryptographic protocols (context) - Merritt - 1983 ACM DBLP
6 Cryptoprotocols: subscription to a public key, the secret bl.. (context) - Yung - 1984 ACM
6 A secure poker protocol that minimizes the effect of player .. (context) - Cr'epeau - 1985 ACM DBLP
6 Geometric shared secret and/or shared control schemes (context) - Simmons - 1990 ACM DBLP
6 Cheating at mental poker (context) - Coppersmith - 1985 ACM DBLP
5 Robust computation in the presence of mobile viruses (context) - Ostrovsky, Yung - 1991
5 Authentication: A practical study in belief and action (context) - Burrows, Abadi et al. - 1988 DBLP
4 The cryptographic security of truncated linearly related var.. (context) - Hastad, Shamir - 1985 ACM DBLP
4 Security, verifiability, and universality in distributed com.. (context) - Huang, Teng - 1990 ACM DBLP
4 Bounded-width branching programs recognize exactly those lan.. (context) - Barrington - 1989
4 On necessary conditions for secure distributed computing - Ostrovsky, Yung - 1990
4 Reducibility among protocols (context) - Blum, Vazirani et al. - 1983 DBLP
4 The spymasters double-agent problem: multiparty computations.. - Chaum - 1989 DBLP
4 Trapdoor pseudo-random number generators, with applications .. (context) - Vazirani, Vazirani - 1983 DBLP
4 Distributing the power of a government to enhance to privacy.. (context) - Benaloh, Yung - 1986
3 Distributed computations tolerating a faulty minority, and m.. (context) - Beaver - 1991
3 the structure of secret key exchange protocols (context) - Bellare, Cowen et al. - 1990
3 Perfectly concealing computationally convincing interactive .. (context) - Brassard, Cr'epeau et al.
2 Communication complexity of secure computing (context) - Franklin, Yung - 1992
1 ACM Distinguished Dissertation Series (context) - Kilian, Randomness et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.columbia.edu/~franklin/papers.html): More
The Blinding of Weak Signatures (Extended Abstract) - Franklin, Yung (Correct)
Low-Exponent RSA with Related Messages - Coppersmith, Franklin, Patarin.. (1996) (Correct)
Secure and Efficient Off-Line Digital Money - Franklin, Yung (1993) (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