978 search results - page 10 / 196 » Knowledge, Probability, and Adversaries |
IFIP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We analyse the C anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Und...
AAAI
2010
14 years 10 months ago
2010
When merging belief sets from different agents, the result is normally a consistent belief set in which the inconsistency between the original sources is not represented. As proba...
90
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
IACR
2011
13 years 9 months ago
2011
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
103
click to vote
UAI
2000
14 years 11 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...