Sciweavers

9997 search results - page 1817 / 2000
» The case for crowd computing
Sort
View
CCS
2010
ACM
15 years 5 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
CCS
2010
ACM
15 years 5 months ago
Security analysis of India's electronic voting machines
Elections in India are conducted almost exclusively using electronic voting machines developed over the past two decades by a pair of government-owned companies. These devices, kn...
Scott Wolchok, Eric Wustrow, J. Alex Halderman, Ha...
SAC
2010
ACM
15 years 5 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
166
Voted
SAC
2010
ACM
15 years 5 months ago
Improving the efficiency of dynamic malware analysis
Each day, security companies see themselves confronted with thousands of new malware programs. To cope with these large quantities, researchers and practitioners alike have develo...
Ulrich Bayer, Engin Kirda, Christopher Kruegel
SPAA
2010
ACM
15 years 5 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
« Prev « First page 1817 / 2000 Last » Next »