1923 search results - page 38 / 385 » Modeling Complexity in Secure Distributed Computing |
GAMESEC
2010
13 years 7 months ago
2010
Abstract. Even the most well-motivated models of information security have application limitations due to the inherent uncertainties involving risk. This paper exemplifies a formal...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
ICNP
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and t...
WSC
2004
13 years 11 months ago
2004
This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utte...
EDBT
2006
ACM
14 years 1 months ago
2006
ACM
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...