FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
FOCS
2007
IEEE
14 years 6 months ago
2007
IEEE
SCCC
2008
IEEE
14 years 6 months ago
2008
IEEE
Domain-Specific Languages (DSLs) are high level languages defined for combining expressivity and simplicity by means of constructs which are close to the problem domain and distan...
SCCC
2008
IEEE
14 years 6 months ago
2008
IEEE
Many Ambient Intelligence (AmI) scenarios fit perfectly for auto-generated distributed networks, but they assume the existence of good enough network topology organizing the conn...
SCCC
2008
IEEE
14 years 6 months ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In this work an automatic meth...