1923 search results - page 91 / 385 » Modeling Complexity in Secure Distributed Computing |
101
click to vote
AI
2002
Springer
14 years 9 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
WSC
1997
14 years 11 months ago
1997
Creating comprehensive simulation models can be expensive and time consuming. This paper discusses our efforts to develop a general methodology that will allow users to quickly an...
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...
100
click to vote
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
155
click to vote
CSFW
2011
IEEE
13 years 9 months ago
2011
IEEE
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...