Tomas Sander, Adam Young  Home/Search
Context Related
| starlab.com/sander/publica...focs99.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 From: starlab.com/sander/publi...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The area of "computing with encrypted data" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and it has many practical applications. The related fundamental area of "secure function evaluation" has been studied since the mid 80's. In its basic two-party case, two parties (Alice and Bob) evaluate a known circuit over private inputs (or a private input and a private circuit). Much attention has been paid to the... (Update)
Similar documents based on text: More All
0.4: Blind, Auditable Membership Proofs - Sander, Ta-Shma, Yung (2000) (Correct)
0.4: The All-or-Nothing Nature of Two-Party Secure Computation - Beimel, Malkin, Micali (1999) (Correct)
0.3: Secure Games with Polynomial Expressions - Kiayias, Yung (2001) (Correct)
Related documents from co-citation: More All
13: How to Generate and Exchange Secrets (context) - Yao
11: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
10: How to Share a Secret (context) - Shamir - 1979
BibTeX entry: (Update)
T. Sander, A. Young, and M. Yung. Non-interactive CryptoComputing for NC1. In 40th Annual Symposium on Foundations of Computer Science, pages 554--567. IEEE, 1999. http://citeseer.ist.psu.edu/sander99noninteractive.html More
@inproceedings{ sander99noninteractive,
author = "Tomas Sander and Adam Young and Moti Yung",
title = "Non-Interactive CryptoComputing For {NC} 1 ",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "554-567",
year = "1999",
url = "citeseer.ist.psu.edu/sander99noninteractive.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing effic.. - Bellare, Rogaway - 1993
531 The Knowledge Complexity of Interactive Proof-Systems (context) - Goldwasser, Micali et al. - 1989
411 How to prove yourself: Practical solutions to identification.. - Fiat, Shamir
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
287 Multiparty unconditionally secure protocols (context) - Chaum, Crepeau et al. - 1988
250 How to play any mental game (context) - Goldreich, Micali et al.
219 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al. - 1988
185 How to generate and exchange secrets (context) - Yao - 1986
162 Public-Key Cryptosystems Based on Composite Degree Residuosi.. - Paillier - 1999
154 Secure Multi-party Computation - Goldreich - 1998
132 Hiding Instances in Multioracle Queries (context) - Beaver, Feigenbaum
111 the composition of zeroknowledge proof systems - Goldreich, Krawczyk - 1996
89 the security of ElGamal-based encryption - Tsiounis, Yung
55 Number-theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold
53 A Minimal Model for Secure Computation - Feige, Kilian et al.
49 Towards Mobile Cryptography - Sander, Tschudin - 1998
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
46 On Data Banks and Privacy Homomorphisms (context) - Rivest, Adleman et al. - 1978
40 Witness Based Cryptographic Program Checking and Robust Func.. - Frankel, Gemmel et al.
39 Algorithms for Black-Box Fields and their Application to Cry.. (context) - Boneh, Lipton
39 Zero-knowledge proofs of knowledge without interaction (context) - De Santis, Persiano
34 Cryptographic Computation: Secure Fault-tolerant Protocols a.. (context) - Galil, Haber et al. - 1987
33 A New Public Key Cryptosystem Based on Higher Residues - Naccache, Stern - 1998
30 How to Solve any Protocol Problem -- An Efficiency Improveme.. - Goldreich, Vainish
27 Uses of randomness in Algorithms and Protocols (context) - Kilian - 1990
24 Dense probabilistic encryption - Benaloh - 1994
20 Secure circuit evaluation: a protocol based on hiding inform.. - Abadi, Feigenbaum - 1990
20 Complexity and Security of Distributed Protocols - Franklin - 1993
15 Naor Non-Malleable Cryptography (context) - Dolev, Dwork
7 DIMACS Series in Discrete Mathematics and Theoretical Comput.. (context) - Feigenbaum, Merritt et al. - 1991
7 Universal Circuits (context) - Valiant
4 On necessary conditions for secure distributed computing - Ostrovsky, Yung - 1991
4 Noninteractive zero-knowledge (context) - Blum, De Santis et al. - 1991
1 Minimum-interactive proofs for decision problems (context) - Galil, Haber et al. - 1989
1 Editor Giovanni Vigna (context) - Security - 1998
1 A New Public-Key Cryptosystem a Secure as Factoring (context) - Okamoto, Uchiyama
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.star-lab.com/sander/publications/index.html): More
Auditable, Anonymous Electronic Cash - Sander, Ta-Shma (1998) (Correct)
Commital Deniable Proofs and Electronic Campaign Finance - Franklin, Sander (Correct)
Deciding Properties of Polynomials without Factoring - Sander, Shokrollahi (1997) (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