Sciweavers

13214 search results - page 2613 / 2643
» Pseudorandomness for network algorithms
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 11 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
SOUPS
2010
ACM
13 years 11 months ago
Usably secure, low-cost authentication for mobile banking
This paper explores user authentication schemes for banking systems implemented over mobile phone networks in the developing world. We analyze an authentication scheme currently d...
Saurabh Panjwani, Edward Cutrell
GRID
2007
Springer
13 years 11 months ago
Global-scale peer-to-peer file services with DFS
The global inter-networking infrastructure that has become essential for contemporary day-to-day computing and communication tasks, has also enabled the deployment of several large...
Antony Chazapis, Georgios Tsoukalas, Georgios Veri...
EUROSYS
2009
ACM
13 years 11 months ago
Effective and efficient compromise recovery for weakly consistent replication
Weakly consistent replication of data has become increasingly important both for loosely-coupled collections of personal devices and for large-scale infrastructure services. Unfor...
Prince Mahajan, Ramakrishna Kotla, Catherine C. Ma...
CCS
2006
ACM
13 years 11 months ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
« Prev « First page 2613 / 2643 Last » Next »