Sciweavers

1627 search results - page 274 / 326
» On context in authorization policy
Sort
View
ASM
2004
ASM
14 years 2 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
TCC
2004
Springer
164views Cryptology» more  TCC 2004»
14 years 2 months ago
Hierarchical Threshold Secret Sharing
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
Tamir Tassa
HPDC
2003
IEEE
14 years 2 months ago
Using Views for Customizing Reusable Components in Component-Based Frameworks
Increasingly, scalable distributed applications are being constructed by integrating reusable components spanning multiple administrative domains. Dynamic composition and deployme...
Anca-Andreea Ivan, Vijay Karamcheti
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
14 years 1 months ago
Fighting Censorship with Algorithms
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
Mohammad Mahdian
AAAI
2006
13 years 10 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer