Sciweavers

ICS
2010
Tsinghua U.
14 years 1 months ago
Effectively Polynomial Simulations
Toniann Pitassi, Rahul Santhanam
ICS
2010
Tsinghua U.
14 years 1 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ICS
2010
Tsinghua U.
14 years 1 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ICS
2010
Tsinghua U.
14 years 1 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
ICS
2010
Tsinghua U.
14 years 1 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
ICS
2010
Tsinghua U.
14 years 1 months ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek