1256 search results - page 228 / 252 » A Simple E-Voting Protocol |
194
Voted
POPL
2009
ACM
16 years 12 days ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
97
Voted
TCC
2009
Springer
16 years 9 days ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
104
Voted
STOC
2006
ACM
16 years 2 days ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
116
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...