Sciweavers

198 search results - page 11 / 40
» Weak Probabilistic Anonymity
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
JVCIR
2010
147views more  JVCIR 2010»
13 years 7 months ago
Modeling, classifying and annotating weakly annotated images using Bayesian network
We propose a probabilistic graphical model to represent weakly annotated images1 . This model is used to classify images and automatically extend existing annotations to new image...
Sabine Barrat, Salvatore Tabbone
SAC
2009
ACM
14 years 1 months ago
A taxonomy and adversarial model for attacks against network log anonymization
In recent years, it has become important for researchers, security incident responders and educators to share network logs, and many log anonymization tools and techniques have be...
Justin King, Kiran Lakkaraju, Adam J. Slagell
QEST
2010
IEEE
13 years 7 months ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
ISW
2007
Springer
14 years 3 months ago
Strongly-Secure Identity-Based Key Agreement and Anonymous Extension
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
Sherman S. M. Chow, Kim-Kwang Raymond Choo