Sciweavers

143 search results - page 12 / 29
» A Range Test Secure in the Active Adversary Model
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
CVPR
2009
IEEE
14 years 3 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
COMPLEXITY
2007
151views more  COMPLEXITY 2007»
13 years 8 months ago
From complex conflicts to stable cooperation: Cases in environment and security
: Conflict is a dynamic and complex form of human interaction, often emerging from incompatible actions, values and goals, and consuming a considerable amount of resources. Conflic...
Jürgen Scheffran, Bruce Hannon
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 9 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...