Sciweavers

1058 search results - page 145 / 212
» Secure Group Communications Using Key Graphs
Sort
View
CN
2010
121views more  CN 2010»
14 years 6 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
WSDM
2012
ACM
352views Data Mining» more  WSDM 2012»
13 years 5 months ago
Multi-relational matrix factorization using bayesian personalized ranking for social network data
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
Artus Krohn-Grimberghe, Lucas Drumond, Christoph F...
IDTRUST
2009
ACM
15 years 4 months ago
Usable secure mailing lists with untrusted servers
Mailing lists are a natural technology for supporting messaging in multi-party, cross-domain collaborative tasks. However, whenever sensitive information is exchanged on such list...
Rakeshbabu Bobba, Joe Muggli, Meenal Pant, Jim Bas...
DIMVA
2010
14 years 11 months ago
HProxy: Client-Side Detection of SSL Stripping Attacks
Abstract. In today's world wide web hundreds of thousands of companies use SSL to protect their customers' transactions from potential eavesdroppers. Recently, a new atta...
Nick Nikiforakis, Yves Younan, Wouter Joosen
CCS
2007
ACM
15 years 4 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder