Uriel Feige
![Hardness of Approximation, NP ⊆ PCP[Polylog,Polylog]](http://data.docslib.org/img/264x/42c871bd2e8bd039ad26347afec0431a.webp)
Top View
- Sponsored by IEEE Computer Society Technical Committee On
- Novel Frameworks for Mining Heterogeneous and Dynamic
- Secure Computation Annotated Bibliography References
- On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner 107
- Limits on Low-Degree Pseudorandom Generators (Or: Sum-Of-Squares Meets Program Obfuscation)
- Non-Interactive Zaps and New Techniques for NIZK
- Distributed Differential Privacy by Sampling
- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract?]
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
- Secure Arithmetic Computation with No Honest Majority
- Safe Machine Learning
- Submission Data for 2020-2021 CORE Conference Ranking Process International Workshop on Randomization and Computation
- The Ordered Covering Problem
- Program of the Thirty-Second Annual ACM Symposium on Theory of Computing
- STOC ’95 to Qualify for the Early Registration Fee, Your Registration Application Must Be Postmarked by Monday, May 1, 1995
- Identity-Based Signatures
- ETH Hardness for Densest-K-Subgraph with Perfect Completeness