Sciweavers

100 search results - page 16 / 20
» Asynchronous Secure Multiparty Computation in Constant Time
Sort
View
DSOM
2009
Springer
14 years 3 months ago
Hidden Markov Model Modeling of SSH Brute-Force Attacks
Abstract. Nowadays, network load is constantly increasing and high-speed infrastructures (1-10Gbps) are becoming increasingly common. In this context, flow-based intrusion detecti...
Anna Sperotto, Ramin Sadre, Pieter-Tjerk de Boer, ...
PAISI
2010
Springer
13 years 6 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
COLCOM
2005
IEEE
14 years 2 months ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
ACMSE
2006
ACM
13 years 10 months ago
Hybrid intelligent systems for network security
Society has grown to rely on Internet services, and the number of Internet users increases every day. As more and more users become connected to the network, the window of opportu...
J. Lane Thames, Randal Abler, Ashraf Saad
PODC
2011
ACM
12 years 11 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...