Sciweavers

131 search results - page 11 / 27
» The complexity of constructing pseudorandom generators from ...
Sort
View
FOCS
2000
IEEE
14 years 2 days ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
TSP
2010
13 years 2 months ago
A complex generalized Gaussian distribution: characterization, generation, and estimation
The generalized Gaussian distribution (GGD) provides a flexible and suitable tool for data modeling and simulation, however the characterization of the complex-valued GGD, in parti...
Mike Novey, Tülay Adali, Anindya Roy
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 28 days ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
COMPGEOM
2003
ACM
14 years 28 days ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
FOCS
2008
IEEE
14 years 2 months ago
Leakage-Resilient Cryptography
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
Stefan Dziembowski, Krzysztof Pietrzak