430 search results - page 37 / 86 » Efficient Proving for Practical Distributed Access-Control S... |
131
Voted
CONEXT
2008
ACM
15 years 4 months ago
2008
ACM
Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the na...
124
Voted
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
103
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
117
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
104
Voted
CCS
2010
ACM
15 years 9 months ago
2010
ACM
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...