Sciweavers

7133 search results - page 1343 / 1427
» Communication algorithms with advice
Sort
View
CCS
2008
ACM
13 years 10 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CCS
2008
ACM
13 years 10 months ago
Privacy oracle: a system for finding application leaks with black box differential testing
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
Jaeyeon Jung, Anmol Sheth, Ben Greenstein, David W...
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 10 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
CONEXT
2005
ACM
13 years 10 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
DEBS
2008
ACM
13 years 10 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki
« Prev « First page 1343 / 1427 Last » Next »