See this document in CiteSeerX!

A Minimal Model for Secure Computation (1994)  (Make Corrections)  (53 citations)
Uri Feige, Joe Kilian, Moni Naor



  Home/Search   Context   Related

 
View or download:
wisdom.weizmann.ac.il/%7Ena...fkn.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisdom.weizmann.ac.il/~na...onpub (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We consider a minimal scenario for secure computation: Parties A and B have private inputs x and y and a shared random string r. A and B are each allowed to send a single message to a third party C, from which C is to learn the value of f(x; y) for some function f , but nothing else. (Update)

Cited by:   More
Cryptography from Anonymity - Yuval Ishai Eyal   (Correct)
Constant-Round Multiparty Computation Using a Black-Box.. - Damgård, Ishai (2005)   (Correct)
How to Split a Shared Secret into Shared Bits in.. - Damgård, Fitzi, .. (2005)   (Correct)

Active bibliography (related documents):   More   All
2.7:   A Minimal Model for Secure Computation - Extended Uri   (Correct)
0.5:   Comparing Information Without Leaking It - Fagin, Naor (1996)   (Correct)
0.2:   On the Complexity of Statistical Reasoning - Kilian, Naor (1998)   (Correct)

Similar documents based on text:   More   All
0.3:   One-Round Secure Computation and Secure Autonomous.. - Cachin, Camenisch.. (2000)   (Correct)
0.3:   The All-or-Nothing Nature of Two-Party Secure Computation - Beimel, Malkin, Micali (1999)   (Correct)
0.3:   Studies in Secure Multiparty Computation and Applications - Canetti (1996)   (Correct)

Related documents from co-citation:   More   All
39:   Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
29:   Completeness Theorems for noncryptographic fault-tolerant distributed computatio.. (context) - Ben-Or, Goldwasser et al. - 1988
28:   How to Play Any Mental Game (context) - Goldreich, Micali et al. - 1987

BibTeX entry:   (Update)

U. Feige, J. Kilian, and M. Naor, "A Minimal Model for Secure Computation", Proc. of 26th STOC, pp. 554-563, 1994. http://citeseer.ist.psu.edu/feige94minimal.html   More

@inproceedings{ feigeminimal,
    author = "Uri Feige and Joe Kilian and Moni Naor",
    title = "A minimal model for secure computation",
    pages = "554--563",
    url = "citeseer.ist.psu.edu/feige94minimal.html" }
Citations (may not include all citations):
287   Multiparty Unconditionally Secure Protocols (context) - Chaum, Cr'epeau et al. - 1988  ACM
250   How to play any mental game (context) - Goldreich, Micali et al. - 1987
177   Completeness Theorems for Non-Cryptographic Fault-Tolerant D.. (context) - Ben-Or, Goldwasser et al. - 1988  ACM
167   Protocols for Secure Computations (context) - Yao - 1982
167   Pseudo-random Generation from Oneway Functions (context) - Hastad, Impagliazzo et al. - 1999
132   Hiding Instances in Multi-Oracle Queries (context) - Beaver, Feigenbaum - 1990
127   Verifiable Secret Sharing and Multiparty Protocols with Hone.. (context) - Rabin, Ben-Or - 1989
95   Limits on the provable consequence of one-way permutations - Impagliazzo, Rudich - 1989
85   On Hiding information From an Oracle - Abadi, Feigenbaum et al. - 1989  ACM   DBLP
66   A zero-one law for Boolean privacy - Chor, Kushilevitz - 1989  ACM   DBLP
49   Non-Cryptographic Fault-Tolerant Computing in a Constant Num.. (context) - Ilan, Beaver
27   Use of Randomness in Algorithms and Protocols (context) - Kilian - 1990
22   A general completeness theorem for two-party games (context) - Kilian - 1991  DBLP
5   Bounded-width polynomial-sized branching programs recognize .. (context) - Barrington - 1988
3   Rivest and L (context) - Shamir - 1981
2   on Foundations of Computer Science (context) - Kushilevitz, communication et al. - 1989
2   Advances in Cryptology - Crypto 87 Proceedings (context) - Brickell, Lee et al. - 1987
2   Advances in Cryptology - Crypto 88 Proceedings (context) - Steer, Strawscynski et al. - 1988
2   Secure Audio Teleconferencing: A Practical Solution (context) - Heiman - 1993  DBLP



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.wisdom.weizmann.ac.il/~naor/onpub.html):   More
Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996)   (Correct)
Certificate Revocation and Certificate Update - Naor, Nissim (1998)   (Correct)
Verification of a human in the loop or Identification via the.. - Naor (1996)   (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