208 search results - page 39 / 42 » Computing Anonymously with Arbitrary Knowledge |
CCS
2001
ACM
13 years 11 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
We present a novel framework for the recognition of facial expressions at arbitrary poses that is based on 2D geometric features. We address the problem by first mapping the 2D loc...
ICDCS
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...