94 search results - page 12 / 19 » On the complexity of verifiable secret sharing and multipart... |
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
HPCA
2006
IEEE
15 years 10 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In P2P file sharing systems, free-riders who use others’ resources without sharing their own cause system-wide performance degradation. Existing techniques to counter freerider...
MOBISYS
2011
ACM
14 years 11 days ago
2011
ACM
Forming secure associations between wireless devices that do not share a prior trust relationship is an important problem. This paper presents ProxiMate, a system that allows wire...