1982 search results - page 376 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
89
Voted
CCS
2010
ACM
14 years 9 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
COMSUR
2008
14 years 9 months ago
2008
Efficient Resource discovery mechanism is one of the fundamental requirement for Grid computing systems, as it aids in resource management and scheduling of applications. Resource...
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
SCP
2010
14 years 7 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...