Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Symposium on Foundations of Computer Science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
Highly Cited
2012
Highly Cited
2012
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Let $f:2^{N} \rightarrow \cal R^{+}$ be a non-decreasing submodular set function, and let $(N,\cal I)$ be a matroid. We consider… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-hard optimization problem. We show… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Massive data sets are increasingly important in a wide range of applications, including observational sciences, product marketing… Expand
Is this relevant?
1994
1994
The proceedings of FOCS'94, sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We argue that the right way to understand distributed protocols is by considering how messages change the state of knowledge of a… Expand
Is this relevant?