Sciweavers

5084 search results - page 744 / 1017
» Proving Possibility Properties
Sort
View
ICDCS
2005
IEEE
16 years 1 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...
ATAL
2005
Springer
16 years 29 days ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
16 years 29 days ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
IPSN
2005
Springer
16 years 28 days ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
16 years 27 days ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb